The weak call-by-value lambda-calculus is reasonable for both time and space
Huvudupphovsmän: | Roth, M, Forster, Y, Kunze, F |
---|---|
Materialtyp: | Conference item |
Språk: | English |
Publicerad: |
Association for Computing Machinery
2020
|
Liknande verk
-
Call-by-value Termination in the Untyped lambda-calculus
av: Neil D. Jones, et al.
Publicerad: (2008-03-01) -
Light Logics and the Call-by-Value Lambda Calculus
av: Paolo Coppola, et al.
Publicerad: (2008-11-01) -
Proof nets and the call-by-value lambda-calculus
av: Beniamino Accattoli
Publicerad: (2013-03-01) -
Call-by-value, call-by-name and the vectorial behaviour of the algebraic \lambda-calculus
av: Ali Assaf, et al.
Publicerad: (2014-12-01) -
Towards a Semantic Measure of the Execution Time in Call-by-Value lambda-Calculus
av: Giulio Guerrieri
Publicerad: (2019-04-01)