Introduction to higher order categorical logic
Introduction to higher order categorical logic
Introduction to combinators and &lgr;-calculus
Introduction to combinators and &lgr;-calculus
Semantics of type theory: correctness, completeness, and independence results
Semantics of type theory: correctness, completeness, and independence results
Handbook of logic in computer science
Some Lambda Calculus and Type Theory Formalized
Journal of Automated Reasoning
Independence Results for Calculi of Dependent Types
Category Theory and Computer Science
Nominal logic, a first order theory of names and binding
Information and Computation - TACS 2001
Electronic Notes in Theoretical Computer Science (ENTCS)
The Category Theoretic Understanding of Universal Algebra: Lawvere Theories and Monads
Electronic Notes in Theoretical Computer Science (ENTCS)
Relational semantics for effect-based program transformations with dynamic allocation
Proceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programming
Journal of Logic and Computation
Binding in Nominal Equational Logic
Electronic Notes in Theoretical Computer Science (ENTCS)
Segal Condition Meets Computational Effects
LICS '10 Proceedings of the 2010 25th Annual IEEE Symposium on Logic in Computer Science
WoLLIC'11 Proceedings of the 18th international conference on Logic, language, information and computation
A kripke logical relation for effect-based program transformations
Proceedings of the 16th ACM SIGPLAN international conference on Functional programming
Structural recursion with locally scoped names
Journal of Functional Programming
Theoretical Computer Science
Adding equations to system f types
ESOP'12 Proceedings of the 21st European conference on Programming Languages and Systems
Nominal Sets: Names and Symmetry in Computer Science
Nominal Sets: Names and Symmetry in Computer Science
| Hi-index | 0.00 |
Reasoning about atoms (names) is difficult. The last decade has seen the development of numerous novel techniques. For equational reasoning, Clouston and Pitts introduced Nominal Equational Logic (NEL), which provides judgements of equality and freshness of atoms. Just as Equational Logic (EL) can be enriched with function types to yield the lambda-calculus (LC), we introduce NLC by enriching NEL with (atom-dependent) function types and abstraction types. We establish meta-theoretic properties of NLC; define -cartesian closed categories, hence a categorical semantics for NLC; and prove soundness & completeness by way of NLC-classifying categories. A corollary of these results is that NLC is an internal language for -cccs. A key feature of NLC is that it provides a novel way of encoding freshness via dependent types, and a new vehicle for studying the interaction of freshness and higher order types.