scientific article; zbMATH DE number 1086682

MaRDI QIDQ4362933zbMATH OpenFDO

Authors Robert F. Stärk

Publication date 13 November 1997

zbMATH Keywords

call-by-name logiccall-by-value logiclogic of partial termslogics for partialitypartial combinatory algebraspartial combinatory logic

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Logic in computer science (03B70)

Recommendations

• Call-by-value combinatory logic and the lambda-value calculus
• Call-by-name, call-by-value, call-by-need and the linear lambda calculus
• scientific article; zbMATH DE number 1231468
• Call-by-value is dual to call-by-name
• Why the constant ‘undefined’? Logics of partial terms for strict and non-strict functional programming languages

Cited in

(8)

• Formalizing non-termination of recursive programs
• Call-by-name, call-by-value, call-by-need and the linear lambda calculus
• Implementing open call-by-value
• Call-By-Push-Value from a Linear Logic Point of View
• Proof-theoretic notions for software maintenance
• Call-by-value is dual to call-by-name
• Explicit mathematics: power types and overloading
• Call-by-value combinatory logic and the lambda-value calculus

Describes a project that uses

Uses Software

• Miranda

This page was built for publication:

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