On basic semantics of untyped functional programs
From MaRDI portal
Publication:840095
DOI10.1134/S0361768809030013zbMATH Open1188.68104OpenAlexW2077542578MaRDI QIDQ840095FDOQ840095
Authors: G. G. Hrachyan 
Publication date: 4 September 2009
Published in: Programming and Computer Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0361768809030013
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)
- On equation systems in monotonic models of typed \(\lambda\)-calculus
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- Why the constant ‘undefined’? Logics of partial terms for strict and non-strict functional programming languages
- Title not available (Why is that?)
- Title not available (Why is that?)
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)
