Recursion principles for syntax with bindings and substitution

Authors:
Andrei Popescu;Elsa L. Gunter
Affiliations:
Technical University Munich, Munich, Germany & University of Illinois at Urbana-Champaign, Urbana-Champaign, IL, USA & Romanian Academy, Bucharest, Romania;University of Illinois, Urbana-Champaign, IL, USA
Venue:
Proceedings of the 16th ACM SIGPLAN international conference on Functional programming
Year:
2011

Citing 35
Cited 0

Categorical combinators

Information and Control
Higher-order abstract syntax

PLDI '88 Proceedings of the ACM SIGPLAN 1988 conference on Programming Language design and Implementation
The foundation of a generic theorem prover

Journal of Automated Reasoning
Parallel reductions in &lgr;-calculus

Information and Computation
Primitive recursion for higher-order abstract syntax

Theoretical Computer Science
Nominal Logic: A First Order Theory of Names and Binding

TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
Higher-Order Abstract Syntax in Coq

TLCA '95 Proceedings of the Second International Conference on Typed Lambda Calculi and Applications
A Mechanisation of Name-Carrying Syntax up to Alpha-Conversion

HUG '93 Proceedings of the 6th International Workshop on Higher Order Logic Theorem Proving and its Applications
Five Axioms of Alpha-Conversion

TPHOLs '96 Proceedings of the 9th International Conference on Theorem Proving in Higher Order Logics
Combining Higher Order Abstract Syntax with Tactical Theorem Proving and (Co)Induction

TPHOLs '02 Proceedings of the 15th International Conference on Theorem Proving in Higher Order Logics
Automated Theorem Proving in a Simple Meta-Logic for LF

CADE-15 Proceedings of the 15th International Conference on Automated Deduction: Automated Deduction
Semantical Analysis of Higher-Order Abstract Syntax

LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Abstract Syntax and Variable Binding

LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
A definitional approach to primitivexs recursion over higher order abstract syntax

MERLIN '03 Proceedings of the 2003 ACM SIGPLAN workshop on Mechanized reasoning about languages with variable binding
Alpha-structural recursion and induction

Journal of the ACM (JACM)
Mechanising λ-calculus using a classical first order theory of terms with permutations

Higher-Order and Symbolic Computation
Mechanizing metatheory in a logical framework

Journal of Functional Programming
Engineering formal metatheory

Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Two-Level Hybrid: A System for Reasoning Using Higher-Order Abstract Syntax

Electronic Notes in Theoretical Computer Science (ENTCS)
Nominal Techniques in Isabelle/HOL

Journal of Automated Reasoning
Mechanizing the Metatheory of LF

LICS '08 Proceedings of the 2008 23rd Annual IEEE Symposium on Logic in Computer Science
Parametric higher-order abstract syntax for mechanized semantics

Proceedings of the 13th ACM SIGPLAN international conference on Functional programming
The Isabelle Framework

TPHOLs '08 Proceedings of the 21st International Conference on Theorem Proving in Higher Order Logics
Theory support for weak higher order abstract syntax in Isabelle/HOL

Proceedings of the Fourth International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice
External and internal syntax of the λ-calculus

Journal of Symbolic Computation
Multi-level meta-reasoning with higher-order abstract syntax

FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software
Finally tagless, partially evaluated: tagless staged interpreters for simpler typed languages

APLAS'07 Proceedings of the 5th Asian conference on Programming languages and systems
Isabelle/HOL: a proof assistant for higher-order logic

Isabelle/HOL: a proof assistant for higher-order logic
Proof pearl: de Bruijn terms really do work

TPHOLs'07 Proceedings of the 20th international conference on Theorem proving in higher order logics
Strong Normalization for System F by HOAS on Top of FOAS

LICS '10 Proceedings of the 2010 25th Annual IEEE Symposium on Logic in Computer Science
General bindings and alpha-equivalence in nominal Isabelle

ESOP'11/ETAPS'11 Proceedings of the 20th European conference on Programming languages and systems: part of the joint European conferences on theory and practice of software
A recursion combinator for nominal datatypes implemented in Isabelle/HOL

IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Nominal techniques in Isabelle/HOL

CADE' 20 Proceedings of the 20th international conference on Automated Deduction
Contributions to the theory of syntax with bindings and to process algebra

Contributions to the theory of syntax with bindings and to process algebra
A Canonical Locally Named Representation of Binding

Journal of Automated Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

We characterize the data type of terms with bindings, freshness and substitution, as an initial model in a suitable Horn theory. This characterization yields a convenient recursive definition principle, which we have formalized in Isabelle/HOL and employed in a series of case studies taken from the λ-calculus literature.