Filter Models and Easy Terms

Authors:
Fabio Alessi;Mariangiola Dezani-Ciancaglini;Furio Honsell
Affiliations:
-;-;-
Venue:
ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
Year:
2001

Citing 14
Cited 5

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

Information and Computation
Topology via logic

Topology via logic
Operational, denotational and logical descriptions: a case study

Fundamenta Informaticae - Special issue on mathematical foundations of computer science '91
Set-theoretical and other elementary models of the &lgr;-calculus

Theoretical Computer Science - A collection of contributions in honour of Corrado Bo¨hm on the occasion of his 70th birthday
An approximation theorem for topological lambda models and the topological incompleteness of lambda calculus

Journal of Computer and System Sciences
Full abstraction in the lazy lambda calculus

Information and Computation
Foundations of programming languages

Foundations of programming languages
Church-Rosser &lgr;-theories, infinite &lgr;-terms and consistency problems

Logic: from foundations to applications
On the Jacopini technique

Information and Computation
Semantical analysis of perpetual strategies in &lgr;-calculus

Theoretical Computer Science - Special issue: Gentzen
Compositional Characterizations of lambda-Terms Using Intersection Types

MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
An Abstract Notion of Application

TLCA '93 Proceedings of the International Conference on Typed Lambda Calculi and Applications
A condition for identifying two elements of whatever model of combinatory logic

Proceedings of the Symposium on Lambda-Calculus and Computer Science Theory
The call-by-value λ-calculus: a semantic investigation

Mathematical Structures in Computer Science

Intersection types and domain operators

Theoretical Computer Science - Logic, semantics and theory of programming
Graph models of $\lambda$-calculus at work, and variations

Mathematical Structures in Computer Science
Intersection types and lambda models

Theoretical Computer Science - Logic, language, information and computation
Calculi, types and applications

Theoretical Computer Science
An irregular filter model

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We illustrate the use of intersection types as a tool for synthesizing 驴-models which exhibit special purpose features. We focus on semantical proofs of easiness. This allows us to prove that the class of 驴-theories induced by graph models is strictly included in the class of 驴-theories induced by non-extensional filter models.