• Publications
  • Influence
λ Δ -Models
TLDR
To study the operational behaviour of λ-terms, we will use the denotational (mathematical) approach. Expand
  • 832
  • 64
  • PDF
Principal Type Schemes for an Extended Type Theory
TLDR
We consider the extension of Curry's basic functionality theory presented by Barendregt et al. (to appear), and we define, for any term X, a principal type scheme (p.t.s.). Expand
  • 102
  • 10
The Parametric λ-Calculus
A calculus is a language equipped with some reduction rules. All the calculi we consider in this book share the same language, which is the language of λ-calculus, while they differ each other inExpand
  • 15
  • 8
Principal Type Scheme and Unification for Intersection Type Discipline
  • S. Rocca
  • Computer Science, Mathematics
  • Theor. Comput. Sci.
  • 1 July 1988
TLDR
We show that a term satisfying a given property has a principal type scheme in an extended meaning, i.e., there is a type scheme deducible for it from which all and only the type schemes deducibles for it are reachable, by means of suitable operations. Expand
  • 81
  • 5
An Approximation Theorem for Topological Lambda Models and the Topological Incompleteness of Lambda Calculus
Abstract It is well known that a reflexive object in the Cartesian closed category of complete partial orders and Scott-continuous functions is a model of λ-calculus (briefly a topological model). AExpand
  • 104
  • 4
Call-by-value Solvability
TLDR
The notion of solvability in the call-by-value λ -calculus is defined and completely characterized, both from an operational and a logical point of view. Expand
  • 49
  • 4
The Parametric Lambda Calculus
TLDR
We present a list of functions that can be used to evaluate the discriminability of a set of functions. Expand
  • 38
  • 4
  • PDF
The call-by-value λ-calculus: a semantic investigation
This paper is about a categorical approach for modelling the pure (i.e., without constants) call-by-value λ-calculus, defined by Plotkin as a restriction of the call-by-name λ-calculus. InExpand
  • 21
  • 3
  • PDF
Characterization Theorems for a Filter Lambda Model
  • S. Rocca
  • Mathematics, Computer Science
  • Inf. Control.
  • 1 September 1982
TLDR
The filter λ-model is a model of the ,λ-calculus, based on a system of type assignment which extends the basic functionality theory of Curry, invented in order to give a completeness proof for Scott's semantics of Curry's type assignment. Expand
  • 16
  • 3
Operational, denotational and logical descriptions: a case study
  • 84
  • 2
...
1
2
3
4
5
...