scientific article; zbMATH DE number 5033863
From MaRDI portal
Publication:5472909
Recommendations
- On proving the correctness of program transformations based on free theorems for higher-order polymorphic calculi
- On the Proof Theory of Program Transformations
- Refined typing to localize the impact of forced strictness on free theorems
- Program transformations in a denotational setting
- Publication:4934141
- scientific article; zbMATH DE number 1222428
- Proving theorems by program transformation
- An Intensional Semantics for Elementary Program Transformations
- A higher-order abstract syntax approach to verified transformations on functional programs
- Free theorems and runtime type representations
Cited in
(7)- A family of syntactic logical relations for the semantics of Haskell-like languages
- Selective strictness and parametricity in structural operational semantics, inequationally
- Free theorems in the presence of seq
- On proving the correctness of program transformations based on free theorems for higher-order polymorphic calculi
- Semantics and Pragmatics of New Shortcut Fusion Rules
- Making ``stricterness more relevant
- Refined typing to localize the impact of forced strictness on free theorems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5472909)