Lambda calculi and linear speedups

DOI10.1007/3-540-36377-7_4MaRDI QIDQ4414725zbMATH OpenFDO

Authors David Sands, Jörgen Gustavsson, Andrew Moran

Publication date 27 July 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2566/25660060.htm

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Recommendations

• The call-by-need lambda calculus
• On the value of variables
• scientific article; zbMATH DE number 1231468
• The call-by-need lambda calculus
• Call-by-name, call-by-value, call-by-need and the linear lambda calculus

Cited in

(18)

• (In)efficiency and reasonable cost models
• On the value of variables
• The useful MAM, a reasonable implementation of the strong -calculus
• On the value of variables
• Open call-by-value
• A two-valued logic for properties of strict functional programs allowing partial functions
• Shrinking lambda expressions in linear time
• Lambda-lifting in quadratic time
• On the first-order equivalence of call-by-name and call-by-value
• The Negligible and Yet Subtle Cost of Pattern Matching
• A Fresh Look at the λ-Calculus
• Constant time parallel computations in \(\lambda\)-calculus
• Exponentials as Substitutions and the Cost of Cut Elimination in Linear Logic
• Verifying the correctness and amortized complexity of a union-find implementation in separation logic with time credits
• Positive focusing is directly useful
• IMELL cut elimination with linear overhead
• Reasonable space for the -calculus, logarithmically
• The cost of skeletal call-by-need, smoothly

This page was built for publication: Lambda calculi and linear speedups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4414725)