A Semantical and Operational Account of Call-by-Value Solvability

DOI10.1007/978-3-642-54830-7_7zbMath1405.68056OpenAlexW70544678MaRDI QIDQ5410667

Giulio Guerrieri, Alberto Carraro

Publication date: 16 April 2014

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

Full work available at URL: https://doi.org/10.1007/978-3-642-54830-7_7

zbMATH Keywords

solvabilityrelational semanticstestspotential valuability(resource) call-by-value lambda-calculusweak and stratified reductions

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55)

Related Items (17)

Unnamed Item ⋮ Open Call-by-Value ⋮ Proof nets and the call-by-value \(\lambda\)-calculus ⋮ Exponentials as Substitutions and the Cost of Cut Elimination in Linear Logic ⋮ Node Replication: Theory And Practice ⋮ Quantitative global memory ⋮ Tight typings and split bounds, fully developed ⋮ Head reduction and normalization in a call-by-value lambda-calculus ⋮ The spirit of node replication ⋮ Unnamed Item ⋮ The bang calculus revisited ⋮ Call-By-Push-Value from a Linear Logic Point of View ⋮ The bang calculus revisited ⋮ Unnamed Item ⋮ A Fresh Look at the λ-Calculus ⋮ On reduction and normalization in the computational core ⋮ Z property for the shuffling calculus

This page was built for publication: A Semantical and Operational Account of Call-by-Value Solvability