Type-safe code transformations in Haskell

DOI10.1016/J.ENTCS.2006.10.036zbMATH Open1277.68049OpenAlexW2026691974MaRDI QIDQ2866331FDOQ2866331

Louis-Julien Guillemette, Stefan Monnier

Publication date: 13 December 2013

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2006.10.036

zbMATH Keywords

compilationtype systemsprogram verificationhigher-order abstract syntax

Mathematics Subject Classification ID

Theory of programming languages (68N15) Specification and verification (program logics, model checking, etc.) (68Q60) Functional programming and lambda calculus (68N18)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Representing Control: a Study of the CPS Transformation
• Formal certification of a compiler back-end or
• Type checking with open type functions
• Associated types with class
• Guarded recursive datatype constructors
• Boxes go bananas
• Flexible representation analysis
• A syntactic approach to foundational proof-carrying code
• A type system for certified binaries
• Meta-programming with built-in type equality
• Programming in Ωmega

Cited In (1)

• Title not available (Why is that?)

Uses Software

• Haskell
• TIL
• TALx86

This page was built for publication: Type-safe code transformations in Haskell

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2866331)