File(s) not publicly available
Minimality in a Linear Calculus with Iteration
presentation
posted on 2023-06-08, 05:29 authored by Sandra Alves, Mario Florido, Ian MackieIan Mackie, François-Régis SinotSystem L is a linear version of Godel's System T, where the @l-calculus is replaced with a linear calculus; or alternatively a linear @l-calculus enriched with some constructs including an iterator. There is thus at the same time in this system a lot of freedom in reduction and a lot of information about resources, which makes it an ideal framework to start a fresh attempt at studying reduction strategies in @l-calculi. In particular, we show that call-by-need, the standard strategy of functional languages, can be defined directly and effectively in System L, and can be shown minimal among weak strategies.
History
Publication status
- Published
Publisher
ElsevierExternal DOI
Volume
204Pages
17.0Presentation Type
- paper
Event name
Electronic Notes in Theoretical Computer ScienceEvent type
conferenceDepartment affiliated with
- Informatics Publications
Full text available
- No
Peer reviewed?
- Yes
Legacy Posted Date
2012-02-06Usage metrics
Categories
No categories selectedKeywords
Licence
Exports
RefWorks
BibTeX
Ref. manager
Endnote
DataCite
NLM
DC