On basic semantics of untyped functional programs
From MaRDI portal
Recommendations
- Semantics of untyped functional programs
- On transformations of untyped functional programs and their procedural semantics
- scientific article; zbMATH DE number 6984327
- scientific article; zbMATH DE number 6823356
- On incomparability of interpretation algorithms of typed functional programs with respect to undefined value
- Program equivalence in an untyped, call-by-value functional language with uncurried functions
- Publication:3475253
- Unsolvability of type correctness problem for functional programs
- scientific article; zbMATH DE number 4200180
- Univalent semantics of constructive type theories
Cites work
Cited in
(9)- scientific article; zbMATH DE number 6984327 (Why is no real title available?)
- scientific article; zbMATH DE number 6823356 (Why is no real title available?)
- On equation systems in monotonic models of typed \(\lambda\)-calculus
- scientific article; zbMATH DE number 1136653 (Why is no real title available?)
- Semantics of untyped functional programs
- On transformations of untyped functional programs and their procedural semantics
- On incomparability of interpretation algorithms of typed functional programs with respect to undefined value
- scientific article; zbMATH DE number 3917684 (Why is no real title available?)
- Why the constant ‘undefined’? Logics of partial terms for strict and non-strict functional programming languages
This page was built for publication: On basic semantics of untyped functional programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q840095)
