Corpus ID: 14109185

A big-step operational semantics via non-idempotent intersection types

@inproceedings{Bernadet2013ABO,
  title={A big-step operational semantics via non-idempotent intersection types},
  author={A. Bernadet and St'ephane Graham-Lengrand},
  year={2013}
}
We present a typing system of non-idempotent intersection types that characterises strongly normalising λ-terms and can been seen as a big-step operational semantics: we prove that a strongly normalising λ-term accepts, as its type, the structure of its normal form. As a by-product of identifying such semantical components in typing trees, we are able to define a trivial measure (the number of times a typing rule is applied) that exactly captures the length of the longest β-reduction sequence… Expand
3 Citations

Figures from this paper

Tight typings and split bounds, fully developed
  • 2
  • Highly Influenced
  • PDF
Tight typings and split bounds
  • 24
  • Highly Influenced
  • PDF

References

SHOWING 1-10 OF 10 REFERENCES
Complexity of Strongly Normalising λ-Terms via Non-idempotent Intersection Types
  • 30
  • PDF
Execution Time of lambda-Terms via Denotational Semantics and Intersection Types
  • D. Carvalho
  • Mathematics, Computer Science
  • Math. Struct. Comput. Sci.
  • 2018
  • 66
  • PDF
Intersection types and lambda models
  • 24
  • PDF
Compositional characterisations of lambda-terms using intersection types
  • 26
Typing and Computational Properties of Lambda Expressions
  • 61
On the Membership Problem for Non-Linear Abstract Categorial Grammars
  • S. Salvati
  • Computer Science, Mathematics
  • J. Log. Lang. Inf.
  • 2010
  • 25
  • PDF
A new type assignment for λ-terms
  • 189
A Filter Lambda Model and the Completeness of Type Assignment
  • 570
Intersection Types for Light Affine Lambda Calculus
  • D. Carvalho
  • Computer Science, Mathematics
  • Electron. Notes Theor. Comput. Sci.
  • 2005
  • 10
  • PDF