Sciweavers

5255 search results - page 547 / 1051
» Formal Methods for Privacy
Sort
View
IFL
2007
Springer
158views Formal Methods» more  IFL 2007»
16 years 1 months ago
Checking Dependent Types Using Compiled Code
Abstract. Type checkers for dependent types need to evaluate user defined functions during type checking. For this, current implementations typically use an interpreter, which has...
Dirk Kleeblatt
IFL
2007
Springer
128views Formal Methods» more  IFL 2007»
16 years 1 months ago
The Structure of the Essential Haskell Compiler, or Coping with Compiler Complexity
In this paper we describe the structure of the Essential Haskell Compiler (EHC) and how we manage its complexity, despite its growth from essentials to a full Haskell compiler. Our...
Atze Dijkstra, Jeroen Fokker, S. Doaitse Swierstra
IFL
2007
Springer
146views Formal Methods» more  IFL 2007»
16 years 1 months ago
A Supercompiler for Core Haskell
Haskell is a functional language, with features such as higher order functions and lazy evaluation, which allow succinct programs. These high-level features present many challenges...
Neil Mitchell, Colin Runciman
MEMOCODE
2005
IEEE
16 years 20 days ago
A synchronous language at work: the story of Lustre
We recall the story of the development of the synchronous data-flow language LUSTRE and of its industrial transfer inside the toolset SCADE. We try to analyse the reasons of its ...
Nicolas Halbwachs
CAV
2005
Springer
196views Hardware» more  CAV 2005»
16 years 19 days ago
The AVISPA Tool for the Automated Validation of Internet Security Protocols and Applications
Alessandro Armando, David A. Basin, Yohan Boichut,...