Articles citing this article

The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).

Cited article:

This article has been cited by the following article(s):

Formal neighbourhoods, combinatory Böhm trees, and untyped normalization by evaluation

Peter Dybjer and Denis Kuperberg
Annals of Pure and Applied Logic 163 (2) 122 (2012)
DOI: 10.1016/j.apal.2011.06.021
See this article

Foundations of Software Science and Computation Structures

Pierre Clairambault and Peter Dybjer
Lecture Notes in Computer Science, Foundations of Software Science and Computation Structures 9034 56 (2015)
DOI: 10.1007/978-3-662-46678-0_4
See this article

Analytic proof systems for λ-calculus: the elimination of transitivity, and why it matters

Pierluigi Minari
Archive for Mathematical Logic 46 (5-6) 385 (2007)
DOI: 10.1007/s00153-007-0039-1
See this article

Types for Proofs and Programs

J. Schwinghammer
Lecture Notes in Computer Science, Types for Proofs and Programs 4941 173 (2008)
DOI: 10.1007/978-3-540-68103-8_12
See this article