Type Preorders and Recursive Terms

Authors:
Fabio Alessi;Mariangiola Dezani-Ciancaglini
Affiliations:
Dipartimento di Matematica e Informatica, Università degli Studi di Udine, Via delle Scienze 208, 33100 Udine (Italy);Dipartimento di Informatica, Università degli Studi di Torino, corso Svizzera 185, 10149 Torino (Italy)
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2005

Citing 11
Cited 1

Type theories, normal forms, and D∞-lambda-models

Information and Computation
An approximation theorem for topological lambda models and the topological incompleteness of lambda calculus

Journal of Computer and System Sciences
On the Jacopini technique

Information and Computation
Extending the type checker of Standard ML by polymorphic recursion

Theoretical Computer Science - Special issue: Gentzen
The Definition of Standard ML

The Definition of Standard ML
An Extended Polymorphic Type System for Applicative Languages

MFCS '80 Proceedings of the 9th Symposium on Mathematical Foundations of Computer Science
A condition for identifying two elements of whatever model of combinatory logic

Proceedings of the Symposium on Lambda-Calculus and Computer Science Theory
Polymorphic Type Schemes and Recursive Definitions

Proceedings of the 6th Colloquium on International Symposium on Programming
The Y-combinator in Scott''s Lambda-calculus Models

The Y-combinator in Scott''s Lambda-calculus Models
Intersection types and domain operators

Theoretical Computer Science - Logic, semantics and theory of programming
Behavioural inverse limit λ-models

Theoretical Computer Science - Logic, semantics and theory of programming

Calculi, types and applications

Theoretical Computer Science

Quantified Score

Hi-index	0.01

Visualization

Abstract

We show how to use intersection types for building models of a @l-calculus enriched with recursive terms, whose intended meaning is of minimal fixed points. As a by-product we prove an interesting consistency result.