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
A calculus of mobile processes, II
Information and Computation
Proof theoretic approach to specification languages
Proof theoretic approach to specification languages
Forum: a multiple-conclusion specification logic
ALP Proceedings of the fourth international conference on Algebraic and logic programming
&pgr;-calculus, internal mobility, and agent-passing calculi
TAPSOFT '95 Selected papers from the 6th international joint conference on Theory and practice of software development
Cut-elimination for a logic with definitions and induction
Theoretical Computer Science - Special issue on proof-search in type-theoretic languages
Foundational aspects of syntax
ACM Computing Surveys (CSUR)
&pgr;-calculus in (Co)inductive-type theory
Theoretical Computer Science - Special issues on models and paradigms for concurrency
Reasoning with higher-order abstract syntax in a logical framework
ACM Transactions on Computational Logic (TOCL)
STACS '87 Proceedings of the 4th Annual Symposium on Theoretical Aspects of Computer Science
Cut Elimination for Logics with Definitional Reflection
Proceedings of the International Workshop on Nonclassical Logics and Information Processing
FoSSaCS '01 Proceedings of the 4th International Conference on Foundations of Software Science and Computation Structures
A Higher-Order Specification of the pi-Calculus
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
Abstract Syntax for Variable Binders: An Overview
CL '00 Proceedings of the First International Conference on Computational Logic
System Description: Teyjus - A Compiler and Abstract Machine Based Implementation of lambda-Prolog
CADE-16 Proceedings of the 16th International Conference on Automated Deduction: Automated Deduction
Encoding transition systems in sequent calculus
Theoretical Computer Science - Linear logic
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
Abstract Syntax and Variable Binding
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Reasoning in a logic with definitions and induction
Reasoning in a logic with definitions and induction
Reasoning about logic programs using definitions and induction
Reasoning about logic programs using definitions and induction
Some uses of higher-order logic in computational linguistics
ACL '86 Proceedings of the 24th annual meeting on Association for Computational Linguistics
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
A proof theory for generic judgments
ACM Transactions on Computational Logic (TOCL)
Reasoning with hypothetical judgments and open terms in hybrid
PPDP '09 Proceedings of the 11th ACM SIGPLAN conference on Principles and practice of declarative programming
| Hi-index | 0.00 |
The operational semantics of a computation system is often presented as inference rules or, equivalently, as logical theories. Specifications can be made more declarative and high-level if syntactic details concerning bound variables and substitutions are encoded directly into the logic using term-level abstractions (驴-abstraction) and proof-level abstractions (eigenvariables). When one wishes to reason about relations defined using term-level abstractions, generic judgment are generally required. Care must be taken, however, so that generic judgments are not uniformly handled using proof-level abstractions. Instead, we present a technique for encoding generic judgments and show two examples where generic judgments need to be treated at the term level: one example is an interpreter for Horn clauses extended with universal quantified bodies and the other example is that of the 驴-calculus.