Free theorems in the presence of seq

DOI10.1145/964001.964010zbMath1325.68047OpenAlexW1968277829MaRDI QIDQ3452253

Patricia Johann, Janis Voigtländer

Publication date: 11 November 2015

Published in: Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/964001.964010

zbMATH Keywords

program transformationsHaskelldenotational semanticslogical relationsparametricitycorrectness proofstheorems for freeshort cut fusioncontrolling strict evaluation

Mathematics Subject Classification ID

Theory of programming languages (68N15) Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (8)

Shortcut fusion rules for the derivation of circular and higher-order programs ⋮ Safe typing of functional logic programs with opaque patterns and local bindings ⋮ Selective strictness and parametricity in structural operational semantics, inequationally ⋮ Parametricity, type equality, and higher-order polymorphism ⋮ A family of syntactic logical relations for the semantics of Haskell-like languages ⋮ Parametricity for Haskell with Imprecise Error Semantics ⋮ From parametric polymorphism to models of polymorphic FPC ⋮ Free Theorems and Runtime Type Representations

This page was built for publication: Free theorems in the presence of seq