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 formalization of an Ordered Logical Framework in Hybrid with applications to continuation machines
MERLIN '03 Proceedings of the 2003 ACM SIGPLAN workshop on Mechanized reasoning about languages with variable binding
PPDP '04 Proceedings of the 6th ACM SIGPLAN international conference on Principles and practice of declarative programming
Nominal rewriting with name generation: abstraction vs. locality
PPDP '05 Proceedings of the 7th ACM SIGPLAN international conference on Principles and practice of declarative programming
Toward a general theory of names: binding and scope
Proceedings of the 3rd ACM SIGPLAN workshop on Mechanized reasoning about languages with variable binding
Translating specifications from nominal logic to CIC with the theory of contexts
Proceedings of the 3rd ACM SIGPLAN workshop on Mechanized reasoning about languages with variable binding
Combining higher-order abstract syntax with first-order abstract syntax in ATS
Proceedings of the 3rd ACM SIGPLAN workshop on Mechanized reasoning about languages with variable binding
A proof theory for generic judgments
ACM Transactions on Computational Logic (TOCL)
Model checking for π-calculus using proof search
CONCUR 2005 - Concurrency Theory
ACM SIGACT News
Relating State-Based and Process-Based Concurrency through Linear Logic
Electronic Notes in Theoretical Computer Science (ENTCS)
Closing the stage: from staged code to typed closures
PEPM '08 Proceedings of the 2008 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Specifying Properties of Concurrent Computations in CLF
Electronic Notes in Theoretical Computer Science (ENTCS)
A Meta Linear Logical Framework
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
On the Expressivity of Minimal Generic Quantification
Electronic Notes in Theoretical Computer Science (ENTCS)
A universe of binding and computation
Proceedings of the 14th ACM SIGPLAN international conference on Functional programming
Proof search specifications of bisimulation and modal logics for the π-calculus
ACM Transactions on Computational Logic (TOCL)
A Proof Search Specification of the π-Calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
A Congruence Format for Name-passing Calculi
Electronic Notes in Theoretical Computer Science (ENTCS)
Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming
Information and Computation
Reasoning about computations using two-levels of logic
APLAS'10 Proceedings of the 8th Asian conference on Programming languages and systems
Soutei, a logic-based trust-management system
FLOPS'06 Proceedings of the 8th international conference on Functional and Logic Programming
Representing and reasoning with operational semantics
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
A unifying model of variables and names
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
A simpler proof theory for nominal logic
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Permissive-nominal logic: First-order logic over nominal terms and sets
ACM Transactions on Computational Logic (TOCL)
PNL to HOL: From the logic of nominal sets to the logic of higher-order functions
Theoretical Computer Science
A Computational Interpretation of Parametricity
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Names for free: polymorphic views of names and binders
Proceedings of the 2013 ACM SIGPLAN symposium on Haskell
| Hi-index | 0.00 |
A powerful and declarative means of specifying computationscontaining abstractions involves meta-level, universallyquantified generic judgments. We present a prooftheory for such judgments in which signatures are associatedto each sequent (used to account for eigenvariables ofthe sequent) and to each formula in the sequent (used toaccount for generic variables locally scoped over the formula).A new quantifier, \bigtriangledown, is introduced to explicitly manipulatethe local signature. Intuitionistic logic extendedwith \bigtriangledown satisfies cut-elimination even when the logic is additionallystrengthened with a proof theoretic notion of definitions.The resulting logic can be used to encode naturallya number of examples involving name abstractions, and weillustrate using the \pi-calculus and the encoding of object-levelprovability.