Normalization, approximation, and semantics for combinator systems

Authors:
Steffen van Bakel;Maribel Fernández
Affiliations:
Department of Computing, Imperial College, 180 Queen's Gate, London SW7 2BZ, UK;LIENS (CNRS UMR 8548), École Normale Supérieure, 45 rue d'Ulm, 75005 Paris, France
Venue:
Theoretical Computer Science
Year:
2003

Citing 11
Cited 4

Full abstraction and limiting completeness in equational languages

Theoretical Computer Science
Rewrite systems

Handbook of theoretical computer science (vol. B)
Semantic domains

Handbook of theoretical computer science (vol. B)
Sequentiality in orthogonal term rewriting systems

Journal of Symbolic Computation
Intersection types for combinatory logic

Theoretical Computer Science
Complete restrictions of the intersection type discipline

Theoretical Computer Science
Term rewriting systems

Handbook of logic in computer science (vol. 2)
Intersection type assignment systems

Selected papers of the thirteenth conference on Foundations of software technology and theoretical computer science
Normalization results for typeable rewrite systems

Information and Computation
Principles of OBJ2

POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Approximation and Normalization Results for Typeable Term Rewriting Systems

HOA '95 Selected Papers from the Second International Workshop on Higher-Order Algebra, Logic, and Term Rewriting

Strict intersection types for the Lambda Calculus

ACM Computing Surveys (CSUR)
Approximation semantics and expressive predicate assignment for object-oriented programming

TLCA'11 Proceedings of the 10th international conference on Typed lambda calculi and applications
Least upper bounds on the size of confluence and church-rosser diagrams in term rewriting and λ-calculus

ACM Transactions on Computational Logic (TOCL)
Semantic Types and Approximation for Featherweight Java

Theoretical Computer Science

Quantified Score

Hi-index	5.23

Visualization

Abstract

This paper studies normalization of typeable terms and the relation between approximation semantics and filter models for Combinator Systems. It presents notions of approximants for terms, intersection type assignment, and reduction on type derivations; the last will be proved to be strongly normalizable. With this result, it is proved that every typeable term has an approximant with the same type, and a characterization of the normalization behaviour of terms using their assignable types is given. Then the two semantics are defined and compared, and it is shown that the approximants semantics is fully abstract but the filter semantics is not.