Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Filinski, Andrzej
and
Korsholm Rohde, Henning
2004.
Foundations of Software Science and Computation Structures.
Vol. 2987,
Issue. ,
p.
167.
Danvy, Olivier
2005.
From Reduction-based to Reduction-free Normalization.
Electronic Notes in Theoretical Computer Science,
Vol. 124,
Issue. 2,
p.
79.
Filinski, Andrzej
and
Rohde, Henning Korsholm
2005.
Denotational aspects of untyped normalization by evaluation.
RAIRO - Theoretical Informatics and Applications,
Vol. 39,
Issue. 3,
p.
423.
Abel, Andreas
Aehlig, Klaus
and
Dybjer, Peter
2007.
Normalization by Evaluation for Martin-Löf Type Theory with One Universe.
Electronic Notes in Theoretical Computer Science,
Vol. 173,
Issue. ,
p.
17.
Abel, Andreas
Coquand, Thierry
and
Dybjer, Peter
2007.
Normalization by Evaluation for Martin-Löf Type Theory with Typed Equality Judgements.
p.
3.
Minari, Pierluigi
2007.
Analytic proof systems for λ-calculus: the elimination of transitivity, and why it matters.
Archive for Mathematical Logic,
Vol. 46,
Issue. 5-6,
p.
385.
Aehlig, Klaus
Haftmann, Florian
and
Nipkow, Tobias
2008.
Theorem Proving in Higher Order Logics.
Vol. 5170,
Issue. ,
p.
39.
Schwinghammer, J.
2008.
Types for Proofs and Programs.
Vol. 4941,
Issue. ,
p.
173.
Abel, Andreas
Coquand, Thierry
and
Pagano, Miguel
2009.
Typed Lambda Calculi and Applications.
Vol. 5608,
Issue. ,
p.
5.
Abel, Andreas
Coquand, Thierry
and
Pagano, Miguel
2011.
A Modular Type-checking algorithm for Type Theory with Singleton Types and Proof Irrelevance.
Logical Methods in Computer Science,
Vol. Volume 7, Issue 2,
Issue. ,
AEHLIG, KLAUS
HAFTMANN, FLORIAN
and
NIPKOW, TOBIAS
2012.
A compiled implementation of normalisation by evaluation.
Journal of Functional Programming,
Vol. 22,
Issue. 1,
p.
9.
Berardi, Stefano
and
Tatsuta, Makoto
2012.
Internal models of system F for decompilation.
Theoretical Computer Science,
Vol. 435,
Issue. ,
p.
3.
Dybjer, Peter
and
Kuperberg, Denis
2012.
Formal neighbourhoods, combinatory Böhm trees, and untyped normalization by evaluation.
Annals of Pure and Applied Logic,
Vol. 163,
Issue. 2,
p.
122.
García-Pérez, Álvaro
Nogueira, Pablo
and
Moreno-Navarro, Juan José
2013.
Deriving the full-reducing Krivine machine from the small-step operational semantics of normal order.
p.
85.
García-Pérez, A.
and
Nogueira, P.
2014.
On the syntactic and functional correspondence between hybrid (or layered) normalisers and abstract machines.
Science of Computer Programming,
Vol. 95,
Issue. ,
p.
176.
Clairambault, Pierre
and
Dybjer, Peter
2015.
Foundations of Software Science and Computation Structures.
Vol. 9034,
Issue. ,
p.
56.
Brown, Matt
and
Palsberg, Jens
2017.
Typed self-evaluation via intensional type functions.
p.
415.
Brown, Matt
and
Palsberg, Jens
2017.
Typed self-evaluation via intensional type functions.
ACM SIGPLAN Notices,
Vol. 52,
Issue. 1,
p.
415.
Biernacka, Małgorzata
Biernacki, Dariusz
Charatonik, Witold
and
Drab, Tomasz
2020.
Programming Languages and Systems.
Vol. 12470,
Issue. ,
p.
147.
Biernacka, Malgorzata
Charatonik, Witold
and
Drab, Tomasz
2021.
A Derived Reasonable Abstract Machine for Strong Call by Value.
p.
1.