|
84
|
Reasoning with higher-order abstract syntax in a logical framework
– R McDowell, D Miller
- 2002
|
|
90
|
Semantical analysis of higher-order abstract syntax
– M Hofmann
|
|
117
|
Primitive Recursion for Higher-Order Abstract Syntax
– Joëlle Despeyroux, Frank Pfenning
- 1997
|
|
12
|
Developing (Meta)Theory of lambda-calculus in the Theory of Contexts
– Marino Miculan
- 2001
|
|
10
|
Two-level meta-reasoning in Coq
– Amy P Felty
|
|
634
|
A Framework for Defining Logics
– Robert Harper , Furio Honsell, Gordon Plotkin
- 1993
|
|
269
|
Higher-order abstract syntax
– Frank Pfenning, Conal Elliott
- 1988
|
|
10
|
The Coq Proof Assistant: A Tutorial: Version 6.1
– G HUET, G KAHN, C PAULIN-MOHRING
- 1997
|
|
4
|
A proof of type preservation for the pi-calculus
– Loc HenryGreard
- 1998
|
|
3
|
A full formalization of pi-calculus theory in the Calculus of Constructions
– Daniel Hirschkooe
- 1997
|
|
2
|
Mise en oeuvre de preuves de bisimulation. Phd thesis, #cole Nationale des Ponts et Chauss#es (ENPC
– Daniel Hirschkooe
- 1999
|
|
10
|
Inductive de��nitions in the system Coq; rules and properties
– C Paulin-Mohring
- 1993
|
|
3
|
A modal -calcul with iteration and case constructs
– Joelle Despeyroux, Pierre Leleu
- 1998
|
|
13
|
pi-calculus in (Co)Inductive Type Theory
– Furio Honsell, Marino Miculan, Ivan Scagnetto
- 2001
|
|
62
|
The π-Calculus in Direct Style
– Gerard Boudol
- 1997
|
|
38
|
and Gérard Huet. The Calculus of Constructions
– Thierry Coquand
- 1988
|
|
77
|
The Polyadic pi-Calculus: a Tutorial
– Robin Milner
- 1991
|
|
70
|
A Partially Deadlock-free Typed Process Calculus (I) -- A Simple System --
– Naoki Kobayashi
|
|
77
|
A Concurrent Object Calculus: Reduction and Typing
– Andrew D. Gordon, Paul D. Hankin
- 1998
|
