Constraint-Lambda Calculi

Matthias Holzl, John N Crossley

    Research output: Chapter in Book/Report/Conference proceedingConference PaperResearchpeer-review

    1 Citation (Scopus)

    Abstract

    We introduce two forms of calculi that integrate constraint solving with functional programming. These are the Unrestricted, and the Restricted, Constraint-Lambda Calculi. Unlike previous attempts at combining constraint solving with lambda calculus, these are conservative extensions of traditional lambda calculi in terms of both term reduction and their denotational semantics. We establish a limited form of confluence for the unrestricted calculus and full confluence for the restricted one.
    Original languageEnglish
    Title of host publicationFrontiers of Combining Systems
    Subtitle of host publication4th International Workshop, FroCoS 2002 Santa Margherita Ligure, Italy, April 8-10, 2002 Proceedings
    EditorsAlessandro Armando
    Place of PublicationBerlin Germany
    PublisherSpringer
    Pages207-222
    Number of pages16
    ISBN (Print)3540433813
    DOIs
    Publication statusPublished - 2002
    EventInternational Workshop on Frontiers of Combining Systems 2002 - Santa Margherita Ligure, Italy
    Duration: 8 Apr 200210 Apr 2002
    Conference number: 4th
    https://link.springer.com/book/10.1007/3-540-45988-X (Proceedings)

    Publication series

    NameLecture Notes in Computer Science
    PublisherSpringer
    Volume2309
    ISSN (Print)0302-9743

    Conference

    ConferenceInternational Workshop on Frontiers of Combining Systems 2002
    Abbreviated titleFroCoS 2002
    CountryItaly
    CitySanta Margherita Ligure
    Period8/04/0210/04/02
    Internet address

    Cite this