Type algebras, functor categories and block structure
Algebraic methods in semantics
PLDI '88 Proceedings of the ACM SIGPLAN 1988 conference on Programming Language design and Implementation
Notions of computation and monads
Information and Computation
A framework for defining logics
Journal of the ACM (JACM)
A calculus of mobile processes, II
Information and Computation
Category theory for computing science, 2nd ed.
Category theory for computing science, 2nd ed.
&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)
Higher-Order Abstract Syntax in Coq
TLCA '95 Proceedings of the Second International Conference on Typed Lambda Calculi and Applications
Presheaf Models for the pi-Calculus
CTCS '97 Proceedings of the 7th International Conference on Category Theory and Computer Science
A Fully-Abstract Model for the p-calculus
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
A Fully Abstract Domain Model for the p-Calculus
LICS '96 Proceedings of the 11th 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
Semantics of Name and Value Passing
LICS '01 Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science
Nominal logic, a first order theory of names and binding
Information and Computation - TACS 2001
Consistency of the theory of contexts
Journal of Functional Programming
Parameters And Parametrization In Specification, Using Distributive Categories
Fundamenta Informaticae
Consistency of the theory of contexts
Journal of Functional Programming
About permutation algebras, (pre)sheaves and named sets
Higher-Order and Symbolic Computation
Electronic Notes in Theoretical Computer Science (ENTCS)
Reasoning about Object-based Calculi in (Co)Inductive Type Theory and the Theory of Contexts
Journal of Automated Reasoning
Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Parametric higher-order abstract syntax for mechanized semantics
Proceedings of the 13th ACM SIGPLAN international conference on Functional programming
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Electronic Notes in Theoretical Computer Science (ENTCS)
Higher-order abstract syntax in classical higher-order logic
Proceedings of the Fourth International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice
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
A universe of binding and computation
Proceedings of the 14th ACM SIGPLAN international conference on Functional programming
Journal of Automated Reasoning
25 years of formal proof cultures: some problems, some philosophy, bright future
Proceedings of the Eighth ACM SIGPLAN international workshop on Logical frameworks & meta-languages: theory & practice
| Hi-index | 0.00 |
The Theory of Contexts is a type-theoretic axiomatization aiming to give a metalogical account of the fundamental notions of variable and context as they appear in Higher Order Abstract Syntax. In this paper, we prove that this theory is consistent by building a model based on functor categories. By means of a suitable notion of forcing, we prove that this model validates Classical Higher Order Logic, the Theory of Contexts, and also (parametrised) structural induction and recursion principles over contexts. Our approach, which we present in full detail, should also be useful for reasoning on other models based on functor categories. Moreover, the construction could also be adopted, and possibly generalized, for validating other theories of names and binders.