A certified type-preserving compiler from lambda calculus to assembly language. In Symposium on Programming Languages Design and Implementation, pages 54--65.
Sep 24, 2008 · Abstract. There has been a lot of interest of late for programming languages that incorporate features from dependent type systems and proof.
This allows type-based program verification and is a promising compromise between plain old types and full blown Hoare logic proofs. The introduction of GADTs ...
I present a compiler for the functional language Haskell that preserves some of the properties of Haskell's ... [Show full abstract] type system. The soundness ...
People also ask
Does anyone still use Haskell?
What is the native compiler for Haskell?
Is OCaml better than Haskell?
Is Rust influenced by Haskell?
Abstract. There has been a lot of interest of late for programming languages that incorporate features from dependent type systems and proof.
In this paper we show the development of a compiler (written in Haskell) between a simple imperative language and semi-structured machine code, which preserves ...
This paper shows the development of a compiler (written in Haskell) between a simple imperative language and semi-structured machine code, which preserves ...
A security types preserving compiler in Haskell. A security types preserving ... type instance Max Low x = x type instance Max High x = High type family ...
May 10, 2019 · Abstract. The analysis of information flow has become a popular technique for ensur- ing the confidentiality of data.
In this paper we show the development of a compiler (written in Haskell) between a simple imperative language and semi-structured machine code, which preserves ...