1914 search results - page 2 / 383 » Abstract lambda-Calculus Machines |
FUIN
2010
13 years 6 months ago
2010
Abstract. We present the type rules for a dependently typed core calculus together with a straightforward implementation in Haskell. We explicitly highlight the changes necessary t...
CSL
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. The linear lambda calculus is very weak in terms of expressive power: in particular, all functions terminate in linear time. In this paper we consider a simple extension ...
TCS
1998
13 years 7 months ago
1998
We show that unary PCF, a very small fragment of Plotkin’s PCF [?], cidable observational pre-order, and that its fully abstract model is effectively presentable. This is in ma...
TCS
2008
13 years 7 months ago
2008
We define a new cost model for the call-by-value lambda-calculus satisfying the invariance thesis. That is, under the proposed cost model, Turing machines and the call-by-value la...
AML
2002
13 years 7 months ago
2002
Abstract We extend Barbanera and Berardi's symmetric lambda calculus [2] to second order classical propositional logic and prove its strong normalization.