Semantics of untyped functional programs
From MaRDI portal
Recommendations
- On basic 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
- scientific article; zbMATH DE number 1927416
- Program equivalence in an untyped, call-by-value functional language with uncurried functions
- Functional semantics
- scientific article; zbMATH DE number 1696583
- On incomparability of interpretation algorithms of typed functional programs with respect to undefined value
- Unsolvability of type correctness problem for functional programs
Cited in
(11)- LP structures on type lattices and some refactoring problems
- Denotational semantics of a para-functional programming language
- Functional un\(|\)unparsing
- On transformations of untyped functional programs and their procedural semantics
- Why the constant ‘undefined’? Logics of partial terms for strict and non-strict functional programming languages
- scientific article; zbMATH DE number 1136653 (Why is no real title available?)
- scientific article; zbMATH DE number 2080203 (Why is no real title available?)
- On incomparability of interpretation algorithms of typed functional programs with respect to undefined value
- 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 basic semantics of untyped functional programs
This page was built for publication: Semantics of untyped functional programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1403215)
