Logic programming in the LF logical framework
Logical frameworks
An algorithm for testing conversion in type theory
Logical frameworks
A framework for defining logics
Journal of the ACM (JACM)
Inductive Definitions in the system Coq - Rules and Properties
TLCA '93 Proceedings of the International Conference on Typed Lambda Calculi and Applications
Higher-Order Abstract Syntax in Coq
TLCA '95 Proceedings of the Second International Conference on Typed Lambda Calculi and Applications
Primitive Recursion for Higher-Order Abstract Syntax
TLCA '97 Proceedings of the Third International Conference on Typed Lambda Calculi and Applications
A Metalanguage for Programming with Bound Names Modulo Renaming
MPC '00 Proceedings of the 5th International Conference on Mathematics of Program Construction
Automated Theorem Proving in a Simple Meta-Logic for LF
CADE-15 Proceedings of the 15th International Conference on Automated Deduction: Automated Deduction
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
A Logic for Reasoning with Higher-Order Abstract Syntax
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
A New Approach to Abstract Syntax Involving Binders
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Semantical Analysis of Higher-Order Abstract Syntax
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Higher-order rewriting with dependent types (lambda calculus)
Higher-order rewriting with dependent types (lambda calculus)
Automating the meta theory of deductive systems
Automating the meta theory of deductive systems
The ∇-calculus. functional programming with higher-order encodings
TLCA'05 Proceedings of the 7th international conference on Typed Lambda Calculi and Applications
A type-theoretical approach for ontologies: The case of roles
Applied Ontology
| Hi-index | 0.00 |
This paper describes a calculus of partial recursive functions that range over arbitrary andp ossibly higher-order objects in LF [HHP93]. Its most novel features include recursion under λ-binders and matching against dynamically introduced parameters.