scientific article
From MaRDI portal
Publication:2871856
zbMath1278.03068MaRDI QIDQ2871856
Publication date: 10 January 2014
Full work available at URL: http://www.sciencedirect.com/science/article/pii/S1571066107002289?np=y
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Logic in computer science (03B70) Cut-elimination and normal-form theorems (03F05) Combinatory logic and lambda calculus (03B40)
Related Items
A two-level logic approach to reasoning about computations, Constraint handling rules with binders, patterns and generic quantification, Cut elimination for a logic with induction and co-induction, The Abella Interactive Theorem Prover (System Description), On the Expressivity of Minimal Generic Quantification, Reasoning in Abella about Structural Operational Semantics Specifications, On the Role of Names in Reasoning about λ-tree Syntax Specifications, Non-well-founded deduction for induction and coinduction, Mechanized metatheory revisited
