M. Ashley-Rollman
K. Crary
R. Harper
A solution to the POPLmark Challenge
A. Avron
F. Honsell
I. A. Mason
R. Pollack
1992
Using Typed Lambda Calculus to Implement Formal Systems on a Machine
J. Autom. Reasoning
9
3
309–354
http://dx.doi.org/10.1007/BF00245294
B. E. Aydemir et al.
2005
Mechanized Metatheory for the Masses: The PoplMark Challenge
Joe Hurd
Thomas F. Melham
TPHOLs
Lecture Notes in Computer Science
3603
Springer
50–65
http://dx.doi.org/10.1007/11541868_4
B. E. Aydemir et al.
The POPLmark Challenge
http://www.seas.upenn.edu/~plclub/poplmark/
A. Bucalo
F. Honsell
M. Miculan
I. Scagnetto
M. Hofmann
2006
Consistency of the theory of contexts
J. Funct. Program.
16
3
327–372
http://dx.doi.org/10.1017/S0956796806005892
A. Charguéraud
A solution to the POPLmark Challenge
A. Charguéraud
2011
The Locally Nameless Representation
Journal of Automated Reasoning
1–46
http://dx.doi.org/10.1007/s10817-011-9225-2
A. Chlipala
A solution to the POPLmark Challenge
A. Ciaffaglione
L. Liquori
M. Miculan
2003
Imperative Object-Based Calculi in Co-inductive Type Theories
Moshe Y. Vardi
Andrei Voronkov
LPAR
Lecture Notes in Computer Science
2850
Springer
59–77
http://dx.doi.org/10.1007/978-3-540-39813-4_4
A. Ciaffaglione
L. Liquori
M. Miculan
2003
Reasoning on an imperative object-based calculus in Higher Order Abstract Syntax
MERLIN
ACM
1–10
http://doi.acm.org/10.1145/976571.976574
A. Ciaffaglione
L. Liquori
M. Miculan
2007
Reasoning about Object-based Calculi in (Co)Inductive Type Theory and the Theory of Contexts
J. Autom. Reasoning
39
1
1–47
http://dx.doi.org/10.1007/s10817-006-9061-y
A. Ciaffaglione
I. Scagnetto
2012
A solution to the POPLmark Challenge
T. Coquand
G. P. Huet
1988
The Calculus of Constructions
Inf. Comput.
76
2/3
95–120
http://dx.doi.org/10.1016/0890-5401(88)90005-3
J. Despeyroux
A. P. Felty
A. Hirschowitz
1995
Higher-Order Abstract Syntax in Coq
Mariangiola Dezani-Ciancaglini
Gordon D. Plotkin
TLCA
Lecture Notes in Computer Science
902
Springer
124–138
http://dx.doi.org/10.1007/BFb0014049
M. Fairbairn
A solution to the POPLmark Challenge
M. Gabbay
A. M. Pitts
2002
A New Approach to Abstract Syntax with Variable Binding
Formal Asp. Comput.
13
3-5
341–363
http://dx.doi.org/10.1007/s001650200016
A. Gacek
A solution to the POPLmark Challenge
A. Gacek
2009
A Framework for Specifying, Prototyping, and Reasoning about Computational Systems
University of Minnesota
R. Harper
F. Honsell
G. D. Plotkin
1987
A Framework for Defining Logics
LICS
IEEE Computer Society
194–204
A. Hirschowitz
M. Maggesi
A solution to the POPLmark Challenge
A. Hirschowitz
M. Maggesi
2012
Nested Abstract Syntax in Coq
J. Autom. Reasoning
49
3
409–426
http://dx.doi.org/10.1007/s10817-010-9207-9
M. Hofmann
1999
Semantical Analysis of Higher-Order Abstract Syntax
Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
LICS '99
IEEE Computer Society
Washington, DC, USA
204–
http://dl.acm.org/citation.cfm?id=788021.788940
F. Honsell
M. Miculan
I. Scagnetto
2001
An Axiomatic Approach to Metareasoning on Nominal Algebras in HOAS
Fernando Orejas
Paul G. Spirakis
Jan van Leeuwen
ICALP
Lecture Notes in Computer Science
2076
Springer
963–978
http://dx.doi.org/10.1007/3-540-48224-5_78
F. Honsell
M. Miculan
I. Scagnetto
2001
pi-calculus in (Co)inductive-type theory
Theor. Comput. Sci.
253
2
239–285
http://dx.doi.org/10.1016/S0304-3975(00)00095-5
F. Honsell
M. Miculan
I. Scagnetto
2001
The Theory of Contexts for First Order and Higher Order Abstract Syntax
Electr. Notes Theor. Comput. Sci.
62
116–135
http://dx.doi.org/10.1016/S1571-0661(04)00323-8
X. Leroy
A solution to the POPLmark Challenge
X. Leroy
2007
A locally nameless solution to the POPLmark challenge
Research report
6098
INRIA
M. Miculan
1997
Encoding Logical Theories of Programs
Dipartimento di Informatica, Università di Pisa, Italy
M. Miculan
I. Scagnetto
F. Honsell
2005
Translating specifications from nominal logic to CIC with the theory of contexts
Randy Pollack
MERLIN
ACM
41–49
http://doi.acm.org/10.1145/1088454.1088460
D. Miller
A. Tiu
2005
A proof theory for generic judgments
ACM Trans. Comput. Log.
6
4
749–783
http://doi.acm.org/10.1145/1094622.1094628
C. Paulin-Mohring
1993
Inductive Definitions in the system Coq - Rules and Properties
Marc Bezem
Jan Friso Groote
TLCA
Lecture Notes in Computer Science
664
Springer
328–345
http://dx.doi.org/10.1007/BFb0037116
F. Pfenning
C. Elliott
1988
Higher-Order Abstract Syntax
Richard L. Wexelblat
PLDI
ACM
199–208
http://doi.acm.org/10.1145/53990.54010
B. C. Pierce
2002
Types and programming languages
MIT Press
A. M. Pitts
2003
Nominal logic, a first order theory of names and binding
Inf. Comput.
186
2
165–193
http://dx.doi.org/10.1016/S0890-5401(03)00138-X
W. Ricciotti
A solution to the POPLmark Challenge
I. Scagnetto
M. Miculan
2002
Ambient Calculus and its Logic in the Calculus of Inductive Constructions
Electr. Notes Theor. Comput. Sci.
70
2
76–95
http://dx.doi.org/10.1016/S1571-0661(04)80507-3
A. Stump
A solution to the POPLmark Challenge
The Coq Development Team
2011
The Coq Proof Assitant Reference Manual, version 8.3
INRIA
http://coq.inria.fr/
C. Urban et al.
A solution to the POPLmark Challenge
H. Xi
A solution to the POPLmark Challenge