Finite Combinatory Logic with Intersection Types

DOI10.1007/978-3-642-21691-6_15zbMath1331.03019OpenAlexW21463807MaRDI QIDQ3007665

Paweł Urzyczyn, Jakob Rehof

Publication date: 17 June 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-21691-6_15

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Combinatory logic and lambda calculus (03B40)

Related Items (2)

Finite Combinatory Logic with Intersection Types ⋮ Taming the Merge Operator

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A finite set of functions with an EXPTIME-complete composition problem
• An extension of basic functionality theory for \(\lambda\)-calculus
• Intersection types for combinatory logic
• The Logic of Persistent Intersection
• Finite Combinatory Logic with Intersection Types
• A filter lambda model and the completeness of type assignment
• The Inhabitation Problem for Rank Two Intersection Types
• Synthesis from Component Libraries
• Inhabitation of Low-Rank Intersection Types
• Recognizability in the Simply Typed Lambda-Calculus
• Intersection Types as Logical Formulae
• The emptiness problem for intersection types
• Programming Languages and Systems
• Graph-Based Proof Counting and Enumeration with Applications for Program Fragment Synthesis

This page was built for publication: Finite Combinatory Logic with Intersection Types