Implementing Compositional Analysis Using Intersection Types With Expansion Variables

DOI10.1016/S1571-0661(04)80494-8zbMath1270.68067OpenAlexW2013753363MaRDI QIDQ2842841

A. J. Kfoury, Geoffrey Washburn, J. B. Wells

Publication date: 16 August 2013

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

Full work available at URL: https://doi.org/10.1016/s1571-0661(04)80494-8

Mathematics Subject Classification ID

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

Uses Software

• ML
• Relax NG

Cites Work

• A theory of type polymorphism in programming
• Principality and type inference for intersection types using expansion variables
• Recursive functions of symbolic expressions and their computation by machine, Part I
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item