A binary modal logic for the intersection types of lambda-calculus

Authors:
Silvio Valentini;Matteo Viale
Affiliations:
Dipartimento di Matematica Pura ed Applicata, Università di Padova, via Belzoni, 7, IT-35131 Padova, Italy;Dipartimento di Matematica, Università di Pisa via Buonarroti n.2, I-56126 Pisa, Italy
Venue:
Information and Computation
Year:
2003

Citing 4
Cited 0

Proofs and types

Proofs and types
Lambda-calculus, types and models

Lambda-calculus, types and models
Intersection and union types: syntax and semantics

Information and Computation
A general method for proving the normalization theorem for first and second order typed λ-calculi

Mathematical Structures in Computer Science

Quantified Score

Hi-index	0.01

Visualization

Abstract

We introduce the new families (k, r)-RBC of languages accepted in quasi-realtime by one-way counter automata having k blind counters, of which at least r are reversal-bounded. It is proved, that these families form a strict and linear ...