A family of syntactic logical relations for the semantics of Haskell-like languages
DOI10.1016/J.IC.2007.11.009zbMATH Open1165.68024OpenAlexW2131167088MaRDI QIDQ1012131FDOQ1012131
Authors: Patricia Johann, Janis Voigtländer 
Publication date: 14 April 2009
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: http://libres.uncg.edu/ir/asu/f/Johann_Patricia_2009_A_Family_Of_Syntactic_logical.Haskell.semantics.Logical.pdf
Recommendations
Theory of programming languages (68N15) Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55)
Cites Work
- Title not available (Why is that?)
- Fundamental concepts in programming languages
- Title not available (Why is that?)
- Title not available (Why is that?)
- Programming Languages and Systems
- Proof Tool Support for Explicit Strictness
- Title not available (Why is that?)
- Syntactic logical relations for polymorphic and recursive types
- Title not available (Why is that?)
- Shortcut fusion for accumulating parameters & zip-like functions
- Short cut fusion is correct
- Free theorems in the presence of seq
- Parametric polymorphism and operational equivalence
- Concatenate, reverse and map vanish for free
- Selective strictness and parametricity in structural operational semantics, inequationally
- Typer inference builds a short cut to deforestation
- Interpreting Polymorphic FPC into Domain Theoretic Models of Parametric Polymorphism
- Title not available (Why is that?)
- Title not available (Why is that?)
- Monadic augment and generalised short cut fusion
Cited In (1)
Uses Software
This page was built for publication: A family of syntactic logical relations for the semantics of Haskell-like languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1012131)
