Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Gadducci, Fabio
Miculan, Marino
and
Montanari, Ugo
2006.
About permutation algebras, (pre)sheaves and named sets.
Higher-Order and Symbolic Computation,
Vol. 19,
Issue. 2-3,
p.
283.
Ciaffaglione, Alberto
Liquori, Luigi
and
Miculan, Marino
2007.
Reasoning about Object-based Calculi in (Co)Inductive Type Theory and the Theory of Contexts.
Journal of Automated Reasoning,
Vol. 39,
Issue. 1,
p.
1.
Schöpp, Ulrich
2007.
Modelling Generic Judgements.
Electronic Notes in Theoretical Computer Science,
Vol. 174,
Issue. 5,
p.
19.
Aydemir, Brian
Charguéraud, Arthur
Pierce, Benjamin C.
Pollack, Randy
and
Weirich, Stephanie
2008.
Engineering formal metatheory.
ACM SIGPLAN Notices,
Vol. 43,
Issue. 1,
p.
3.
Gabbay, Murdoch J.
and
Hofmann, Martin
2008.
Logic for Programming, Artificial Intelligence, and Reasoning.
Vol. 5330,
Issue. ,
p.
158.
Licata, Daniel R.
Zeilberger, Noam
and
Harper, Robert
2008.
Focusing on Binding and Computation.
p.
241.
Aydemir, Brian
Charguéraud, Arthur
Pierce, Benjamin C.
Pollack, Randy
and
Weirich, Stephanie
2008.
Engineering formal metatheory.
p.
3.
Chlipala, Adam
2008.
Parametric higher-order abstract syntax for mechanized semantics.
p.
143.
Chlipala, Adam
2008.
Parametric higher-order abstract syntax for mechanized semantics.
ACM SIGPLAN Notices,
Vol. 43,
Issue. 9,
p.
143.
Licata, Daniel R.
and
Harper, Robert
2009.
A universe of binding and computation.
p.
123.
Gunter, Elsa L.
Osborn, Christopher J.
and
Popescu, Andrei
2009.
Theory support for weak higher order abstract syntax in Isabelle/HOL.
p.
12.
Howe, Douglas J.
2009.
Higher-order abstract syntax in classical higher-order logic.
p.
1.
Cheney, James
2009.
A Simple Nominal Type Theory.
Electronic Notes in Theoretical Computer Science,
Vol. 228,
Issue. ,
p.
37.
Licata, Daniel R.
and
Harper, Robert
2009.
A universe of binding and computation.
ACM SIGPLAN Notices,
Vol. 44,
Issue. 9,
p.
123.
Cheney, James
2012.
A dependent nominal type theory.
Logical Methods in Computer Science,
Vol. Volume 8, Issue 1,
Issue. ,
Felty, Amy
and
Momigliano, Alberto
2012.
Hybrid.
Journal of Automated Reasoning,
Vol. 48,
Issue. 1,
p.
43.
Ciaffaglione, Alberto
and
Scagnetto, Ivan
2013.
A weak HOAS approach to the POPLmark Challenge.
Electronic Proceedings in Theoretical Computer Science,
Vol. 113,
Issue. ,
p.
109.
Ciaffaglione, Alberto
and
Scagnetto, Ivan
2014.
Internal Adequacy of Bookkeeping in Coq.
p.
1.
Ciaffaglione, Alberto
and
Scagnetto, Ivan
2015.
Mechanizing type environments in weak HOAS.
Theoretical Computer Science,
Vol. 606,
Issue. ,
p.
57.
PERERA, ROLY
and
CHENEY, JAMES
2018.
Proof-relevant π-calculus: a constructive account of concurrency and causality.
Mathematical Structures in Computer Science,
Vol. 28,
Issue. 9,
p.
1541.
Discussions
No Discussions have been published for this article.