Name
Abstract | ||
|---|---|---|
We present fully abstract encodings of the call-by-name λ-calculus into HOcore, a minimal higher-order process calculus with no name restriction. We consider several equivalences on the λ-calculus side - normal-form bisimilarity, applicative bisimilarity, and contextual equivalence - that we internalize into abstract machines in order to prove full abstraction. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1109/LICS.2017.8005118 | 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) |
Keywords | Field | DocType |
λ-calculus,HOcore,abstract machines,higher-order process calculus,normal-form bisimilarity,applicative bisimilarity,contextual equivalence | Discrete mathematics,Lambda calculus,Monad (category theory),Abstraction,Binary lambda calculus,Computer science,Process calculus,Semantics,Abstract machine,Adjunction,Calculus | Conference |
ISBN | Citations | PageRank |
978-1-5090-3019-4 | 0 | 0.34 |
References | Authors | |
15 | 6 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Malgorzata Biernacka | 1 | 44 | 2.95 |
| Dariusz Biernacki | 2 | 215 | 15.98 |
| Sergueï Lenglet | 3 | 89 | 9.15 |
| Piotr Polesiuk | 4 | 0 | 0.68 |
| Damien Pous | 5 | 240 | 31.00 |
| Alan Schmitt | 6 | 547 | 31.50 |