Sciweavers

2000 search results - page 170 / 400
» Program Transformation and Proof Transformation
Sort
View
158
Voted
HASKELL
2007
ACM
15 years 7 months ago
A type-preserving closure conversion in haskell
The use of typed intermediate languages can significantly increase the reliability of a compiler. By type-checking the code produced at each transformation stage, one can identify...
Louis-Julien Guillemette, Stefan Monnier
141
Voted
ICFP
2003
ACM
16 years 3 months ago
Compiler implementation in a formal logical framework
The task of designing and implementing a compiler can be a difficult and error-prone process. In this paper, we present proach based on the use of higher-order abstract syntax and...
Jason Hickey, Aleksey Nogin, Adam Granicz
ICFP
2002
ACM
16 years 3 months ago
Composing monads using coproducts
Monads are a useful abstraction of computation, as they model diverse computational effects such as stateful computations, exceptions and I/O in a uniform manner. Their potential ...
Christoph Lüth, Neil Ghani
119
Voted
IWSEC
2009
Springer
15 years 10 months ago
Tamper-Tolerant Software: Modeling and Implementation
Abstract. Common software-protection systems attempt to detect malicious observation and modification of protected applications. Upon tamper detection, anti-hacking code may produ...
Mariusz H. Jakubowski, Chit Wei Saw, Ramarathnam V...
118
Voted
ENTCS
2007
100views more  ENTCS 2007»
15 years 3 months ago
Using Template Haskell for Abstract Interpretation
mplate Haskell for Abstract Interpretation Clara Segura1 ,2 Departamento de Sistemas Inform´aticos y Programaci´on Universidad Complutense de Madrid Madrid, Spain Carmen Torrano3...
Clara Segura, Carmen Torrano