Name
Abstract | ||
|---|---|---|
Traditionally the view has been that direct expression of control and storemechanisms and clear mathematical semantics are incompatible requirements. This papershows that adding objects with memory to the call-by-value lambda calculus results in alanguage with a rich equational theory, satisfying many of the usual laws. Combined withother recent work this provides evidence that expressive, mathematically clean programminglanguages are indeed possible.1. OverviewReal programs have... |
Year | DOI | Venue |
|---|---|---|
1991 | 10.1017/S0956796800000125 | J. Funct. Program. |
Keywords | Field | DocType |
lambda calculus,functional language,satisfiability | Deductive lambda calculus,Hindley–Milner type system,Lambda calculus,Programming language,Functional programming,Typed lambda calculus,Algebra,Computer science,System F,Algorithm,Equivalence (measure theory),Curry–Howard correspondence | Journal |
Volume | Issue | Citations |
1 | 3 | 73 |
PageRank | References | Authors |
4.82 | 15 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ian A. Mason | 1 | 797 | 97.47 |
| Carolyn Talcott | 2 | 1922 | 168.73 |