Why the constant ‘undefined’? Logics of partial terms for strict and non-strict functional programming languages

DOI10.1017/S0956796898002974MaRDI QIDQ4236753zbMATH OpenOpenAlexFDO

Authors Robert F. Stärk

Publication date 8 August 1999

Published in Journal of Functional Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s0956796898002974

zbMATH Keywords

basic logic of partial termsfunctional programs

Mathematics Subject Classification ID

Theory of programming languages (68N15)

Recommendations

• A note on undefined expression values in programming logics
• Theoretical Pearls:Representing ‘undefined’ in lambda calculus
• On incomparability of interpretation algorithms of typed functional programs with respect to undefined value
• On basic semantics of untyped functional programs
• Semantics of untyped functional programs
• A logic covering undefinedness in program proofs
• scientific article; zbMATH DE number 4200180
• scientific article; zbMATH DE number 2079019
• scientific article; zbMATH DE number 408794

Cited in

(7)

• Formalizing non-termination of recursive programs
• Axioms for strict and lazy functional programs
• scientific article; zbMATH DE number 1040351 (Why is no real title available?)
• scientific article; zbMATH DE number 1086682 (Why is no real title available?)
• scientific article; zbMATH DE number 2114410 (Why is no real title available?)
• Proof-theoretic notions for software maintenance
• Explicit mathematics: power types and overloading

Describes a project that uses

Uses Software

• Miranda

This page was built for publication: Why the constant ‘undefined’? Logics of partial terms for strict and non-strict functional programming languages

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