Skip to main content
Conference Proceedings

Scott is always simple

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2012) 7464 LNCS 31-45
DOI: 10.1007/978-3-642-32589-2_3
1Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper we give an outline of recent algebraic results concerning theories and models of the untyped lambda calculus. © 2012 Springer-Verlag.

Cite

CITATION STYLE

APA

Salibra, A. (2012). Scott is always simple. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7464 LNCS, pp. 31–45). https://doi.org/10.1007/978-3-642-32589-2_3

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free