Constraint-Lambda Calculi

Matthias Holzl; John N Crossley

doi:10.1007/3-540-45988-X_17

Constraint-Lambda Calculi

Matthias Holzl, John N Crossley

Research output: Chapter in Book/Report/Conference proceeding › Conference Paper › Research › peer-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 language	English
Title of host publication	Frontiers of Combining Systems
Subtitle of host publication	4th International Workshop, FroCoS 2002 Santa Margherita Ligure, Italy, April 8-10, 2002 Proceedings
Editors	Alessandro Armando
Place of Publication	Berlin Germany
Publisher	Springer
Pages	207-222
Number of pages	16
ISBN (Print)	3540433813
DOIs	https://doi.org/10.1007/3-540-45988-X_17
Publication status	Published - 2002
Event	International Workshop on Frontiers of Combining Systems 2002 - Santa Margherita Ligure, Italy Duration: 8 Apr 2002 → 10 Apr 2002 Conference number: 4th https://link.springer.com/book/10.1007/3-540-45988-X (Proceedings)

Publication series

Name	Lecture Notes in Computer Science
Publisher	Springer
Volume	2309
ISSN (Print)	0302-9743

Conference

Conference	International Workshop on Frontiers of Combining Systems 2002
Abbreviated title	FroCoS 2002
Country	Italy
City	Santa Margherita Ligure
Period	8/04/02 → 10/04/02
Internet address	https://link.springer.com/book/10.1007/3-540-45988-X (Proceedings)

Access to Document

10.1007/3-540-45988-X_17

Cite this

@inproceedings{37bfe911dccc48d798a62005e039c024,

title = "Constraint-Lambda Calculi",

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.",

author = "Matthias Holzl and Crossley, {John N}",

year = "2002",

doi = "10.1007/3-540-45988-X_17",

language = "English",

isbn = "3540433813",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "207--222",

editor = "Alessandro Armando",

booktitle = "Frontiers of Combining Systems",

note = "International Workshop on Frontiers of Combining Systems 2002, FroCoS 2002 ; Conference date: 08-04-2002 Through 10-04-2002",

url = "https://link.springer.com/book/10.1007/3-540-45988-X",

}

Holzl, M & Crossley, JN 2002, Constraint-Lambda Calculi. in A Armando (ed.), Frontiers of Combining Systems: 4th International Workshop, FroCoS 2002 Santa Margherita Ligure, Italy, April 8-10, 2002 Proceedings. Lecture Notes in Computer Science, vol. 2309, Springer, Berlin Germany, pp. 207-222, International Workshop on Frontiers of Combining Systems 2002, Santa Margherita Ligure, Italy, 8/04/02. https://doi.org/10.1007/3-540-45988-X_17

Constraint-Lambda Calculi. / Holzl, Matthias; Crossley, John N.

Frontiers of Combining Systems: 4th International Workshop, FroCoS 2002 Santa Margherita Ligure, Italy, April 8-10, 2002 Proceedings. ed. / Alessandro Armando. Berlin Germany : Springer, 2002. p. 207-222 (Lecture Notes in Computer Science; Vol. 2309).

Research output: Chapter in Book/Report/Conference proceeding › Conference Paper › Research › peer-review

TY - GEN

T1 - Constraint-Lambda Calculi

AU - Holzl, Matthias

AU - Crossley, John N

N1 - Conference code: 4th

PY - 2002

Y1 - 2002

N2 - 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.

AB - 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.

U2 - 10.1007/3-540-45988-X_17

DO - 10.1007/3-540-45988-X_17

M3 - Conference Paper

SN - 3540433813

T3 - Lecture Notes in Computer Science

SP - 207

EP - 222

BT - Frontiers of Combining Systems

A2 - Armando, Alessandro

PB - Springer

CY - Berlin Germany

T2 - International Workshop on Frontiers of Combining Systems 2002

Y2 - 8 April 2002 through 10 April 2002

ER -