The weak call-by-value lambda-calculus is reasonable for both time and space
Główni autorzy: | Roth, M, Forster, Y, Kunze, F |
---|---|
Format: | Conference item |
Język: | English |
Wydane: |
Association for Computing Machinery
2020
|
Podobne zapisy
-
Call-by-value Termination in the Untyped lambda-calculus
od: Neil D. Jones, i wsp.
Wydane: (2008-03-01) -
Light Logics and the Call-by-Value Lambda Calculus
od: Paolo Coppola, i wsp.
Wydane: (2008-11-01) -
Proof nets and the call-by-value lambda-calculus
od: Beniamino Accattoli
Wydane: (2013-03-01) -
Call-by-value, call-by-name and the vectorial behaviour of the algebraic \lambda-calculus
od: Ali Assaf, i wsp.
Wydane: (2014-12-01) -
Towards a Semantic Measure of the Execution Time in Call-by-Value lambda-Calculus
od: Giulio Guerrieri
Wydane: (2019-04-01)