Sciweavers

20 search results - page 4 / 4
» Syntax for Free: Representing Syntax with Binding Using Para...
Sort
View
ICFP
2003
ACM
15 years 9 months ago
FreshML: programming with binders made simple
FreshML extends ML with elegant and practical constructs for declaring and manipulating syntactical data involving statically scoped binding operations. User-declared FreshML data...
Mark R. Shinwell, Andrew M. Pitts, Murdoch Gabbay
ENTCS
2007
100views more  ENTCS 2007»
14 years 9 months ago
Type-Safe Code Transformations in Haskell
The use of typed intermediate languages can significantly increase the reliability of a compiler. By typechecking the code produced at each transformation stage, one can identify...
Louis-Julien Guillemette, Stefan Monnier
IRI
2007
IEEE
15 years 3 months ago
ModelML: a Markup Language for Automatic Model Synthesis
Domain-specific modeling has become a popular way of designing and developing systems. It generally involves a systematic use of a set of object-oriented models to represent vari...
Cong Zhang, Amol Bakshi, Viktor K. Prasanna
PLPV
2009
ACM
15 years 6 months ago
Positively dependent types
This paper is part of a line of work on using the logical techniques of polarity and focusing to design a dependent programming language, with particular emphasis on programming w...
Daniel R. Licata, Robert Harper
FOSSACS
2005
Springer
15 years 3 months ago
Model Checking for Nominal Calculi
Nominal calculi have been shown very effective to formally model a variety of computational phenomena. The models of nominal calculi have often infinite states, thus making model ...
Gian Luigi Ferrari, Ugo Montanari, Emilio Tuosto