Mechanical Procedure for Proof Construction via Closed Terms in Typed lambda Calculus (original) (raw)
Related papers
Mechanical procedure for proof construction via closed terms in typed λ calculus
Journal of Automated Reasoning, 1988
Mechanical procedure for proof construction via closed terms in typed ? calculus
Journal of Automated Reasoning, 1988
A Prolog-based Proof Tool for Type-Theory TA-lambda and Implicational Intuitionistic-Logic
EPiC series in computing, 2018
On the Correspondence Between Proofs and lambda-Terms
Technical Reports (CIS), 1993
J-Calc: A typed lambda calculus for Intuitionistic Justification Logic
Special Issue Workshop on Intuitionistic Modal Logic and Applications 2013
Constructive Logics. Part I: A Tutorial on Proof Systems and Typed lambda-Calculi.
On the Algebraic Foundation of Proof Assistants for Intuitionistic Type Theory
Lecture Notes in Computer Science, 2008
Lambda Calculus and Intuitionistic Linear Logic
Studia Logica - An International Journal for Symbolic Logic, 1997
Constructive Logics. Part I: A Tutorial on Proof Systems and Typed -Calculi
1991
A sequent calculus for type theory
Computer Science Logic, 2006
A typed calculus based on a fragment of linear logic
Theoretical Computer Science, 1989
The λ Calculus and the Unity of Structural Proof Theory
Theory of Computing Systems / Mathematical Systems Theory, 2009
A Type-Theoretic Framework for Formal Reasoning with Different Logical Foundations
Lecture Notes in Computer Science, 2007
THE JUDGEMENT CALCULUS FOR INTUITIONISTIC LINEAR LOGIC: PROOF THEORY AND SEMANTICS
Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 1992
Journal of Symbolic Computation, 1985
Theorem proving for untyped constructive -calculus: implementation and application
Logic Journal of IGPL, 2001
Proof-Assistants Using Dependent Type Systems
2001
Stanford Encyclopedia of Philosophy, 2016
On Proofs and Types in Second Order Logic
2015
Proof-term synthesis on dependent-type systems via explicit substitutions
Theoretical computer science, 2001
Implicit and Explicit Typing in Lambda Logic
2008
Sequent combinators: a Hilbert system for the lambda calculus
Mathematical Structures in Computer Science, 2000
On Proof Terms and Embeddings of Classical Substructural Logics
Studia Logica
TR-2005002: The Basic Intuitionistic Logic of Proofs
2005
Soundness and completeness of simply typed λ-calculus
Proof-theoretic Semantics for Classical Mathematics
Synthese, 2006
Formal SOS-Proofs for the Lambda-Calculus
Electronic Notes in Theoretical Computer Science, 2009
Proof-Theoretic Methods in Nonclassical Logic --an Introduction
Mathematical Society of Japan Memoirs, 1998
The intensional lambda calculus
2007
Decidability in Intuitionistic Type Theory is Functionally Decidable
Mathematical Logic Quarterly, 1996
Computational types from a logical perspective
Journal of Functional …, 1998