Tim Sweeney
Research Subjects
Research Interests
Tim Sweeney has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Guy Steele Jr
Oracle Labs, USA
1 shared publication - Joachim Breitner
Unaffiliated, Germany
1 shared publication - Koen Claessen
Chalmers University of Technology, Gothenburg, Sweden
1 shared publication - Lennart Augustsson
Unaffiliated, Gothenburg, Sweden
1 shared publication - Olin Shivers
Northeastern University, Boston, USA
1 shared publication - Ranjit Jhala
University of California San Diego USA
1 shared publication
Latest Publications
- Open Access
- 30 August 2023
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Programming Languages
- Vol. 7 (ICFP) , 417-447
The Verse Calculus: A Core Calculus for Deterministic Functional Logic Programming
Functional logic languages have a rich literature, but it is tricky to give them a satisfying semantics. In this paper we describe the Verse calculus, VC, a new core calculus for deterministic functional logic programming. Our main contribution is to equip VC with a small-step rewrite semantics, so that we can reason about a VC program in the same way as one does with lambda calculus; that is, by applying successive rewrites to it. We also show that the rewrite system is confluent for well-behaved terms.
- 30 August 2023
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Programming Languages
- Vol. 7 (ICFP) , 417-447
Open AccessThe Verse Calculus: A Core Calculus for Deterministic Functional Logic Programming
Functional logic languages have a rich literature, but it is tricky to give them a satisfying semantics. In this paper we describe the Verse calculus, VC, a new core calculus for deterministic functional logic programming. Our main contribution is to equip VC with a small-step rewrite semantics, so that we can reason about a VC program in the same way as one does with lambda calculus; that is, by applying successive rewrites to it. We also show that the rewrite system is confluent for well-behaved terms.