A Linear Spine Calculus
The linear \(\lambda\)-calculus \(\lambda^{\to \multimap \& \top}\) is an interesting system which has unrestricted as well as linear contexts and unrestricted and linear versions of the ``\(\ldots\) is a term of type \(\ldots\) relation. It also has pairing operators and an ``additive unit \(\top\). \(\lambda^{\to \multimap \& \top}\) is used in systems for symbolic computation, such as theorem provers, and logic programming languages. The extra features however make implementation much less efficient than for \(\lambda^{\to }\). The authors introduce the spine calculus \(S^{\to \multimap \& \top}\) and show that there are sound and complete translations of this to and from \(\lambda^{\to \multimap \& \top}\). The spine calculus allows more efficient implementation of critical procedures such as unification. The typable fragment of the spine calculus is shown to be strongly normalizing and has unique \(\beta \eta\)-normal forms.
- A linear logical framework
- Spinal atomic \(\lambda\)-calculus
- Extensional higher-order paramodulation in Leo-III
- Proofs, upside down. A functional correspondence between natural deduction and the sequent calculus
- Structural focalization
- \textsc{Lincx}: a linear logical framework with first-class contexts
- Higher-order dynamic pattern unification for dependent types and records
- \textsc{LeoPARD} -- a generic platform for the implementation of higher-order reasoners
- A Note on the Analytical Resolution of a Nonhydrostatic Standing‐Wave Eigenvalue Problem for a Parabolic Basin
- An insider's look at LF type reconstruction: everything you (n)ever wanted to know
- Superposition for lambda-free higher-order logic
- A comprehensible guide to a new unifier for CIC including universe polymorphism and overloading
- Superposition with lambdas
- Superposition with lambdas
- Superposition for higher-order logic
- Extending a high-performance prover to higher-order logic
- Partial proof terms in the study of idealized proof search
- A type checker for a logical framework with union and intersection types (system description)
- Permutability in proof terms for intuitionistic sequent calculus with cuts
- Coherence via focusing for symmetric skew monoidal and symmetric skew closed categories
- A lambda term representation inspired by linear ordered logic
- Pattern unification for the lambda calculus with linear and affine types
- Two applications of logic programming to Coq
- The \(\lambda \)-calculus and the unity of structural proof theory
This page was built for publication: A Linear Spine Calculus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4444935)