TY  - UNPD
A1  - Schmidt-Schauß, Manfred
A1  - Machkasova, Elena
A1  - Sabel, David
T1  - Extending Abramsky's lazy lambda calculus: (non)-conservativity of embeddings
T2  - Technical report Frank / Johann-Wolfgang-Goethe-Universität, Fachbereich Informatik und Mathematik, Institut für Informatik ; 51
N2  - Our motivation is the question whether the lazy lambda calculus, a pure lambda calculus with the leftmost outermost rewriting strategy, considered under observational semantics, or extensions thereof, are an adequate model for semantic equivalences in real-world purely functional programming languages, in particular for a pure core language of Haskell. We explore several extensions of the lazy lambda calculus: addition of a seq-operator, addition of data constructors and case-expressions, and their combination, focusing on conservativity of these extensions. In addition to untyped calculi, we study their monomorphically and polymorphically typed versions. For most of the extensions we obtain non-conservativity which we prove by providing counterexamples. However, we prove conservativity of the extension by data constructors and case in the monomorphically typed scenario.
T3  - Technical report Frank / Johann-Wolfgang-Goethe-Universität, Fachbereich Informatik und Mathematik, Institut für Informatik - 51 [ver. 2] 
Y1  - 2013
UR  - http://publikationen.ub.uni-frankfurt.de/frontdoor/index/index/docId/33605
UR  - https://nbn-resolving.org/urn:nbn:de:hebis:30:3-336056
UR  - http://www.ki.informatik.uni-frankfurt.de/papers/frank/frank51v2.pdf
N1  - This document is a revised version of an earlier version originally published on the web in April 2013.
IS  - Vers. 22.08.2013
SP  - 1
EP  - 24
PB  - Johann Wolfgang Goethe-Univ., Fachbereich Informatik und Mathematik, Inst. für Informatik, Research group for Artificial Intelligence and Software Technology
CY  - Frankfurt [am Main]
ER  -