Sciweavers

19 search results - page 3 / 4
» Modularizing constructors
Sort
View
POPL
2000
ACM
13 years 9 months ago
Modular Refinement of Hierarchic Reactive Machines
with existing analysis tools. Modular reasoning principles such as abstraction, compositional refinement, and assume-guarantee reasoning are well understood for architectural hiera...
Rajeev Alur, Radu Grosu
POPL
1995
ACM
13 years 9 months ago
Monad Transformers and Modular Interpreters
We show how a set of building blocks can be used to construct programming language interpreters, and present implementations of such building blocks capable of supporting many com...
Sheng Liang, Paul Hudak, Mark P. Jones
ECOOP
2009
Springer
14 years 6 months ago
Featherweight Jigsaw: A Minimal Core Calculus for Modular Composition of Classes
We present FJig, a simple calculus where basic building blocks are classes in the style of Featherweight Java, declaring elds, methods and one constructor. However, inheritance has...
Giovanni Lagorio, Marco Servetto, Elena Zucca
ICFP
2007
ACM
14 years 5 months ago
Call-pattern specialisation for haskell programs
User-defined data types, pattern-matching, and recursion are ubiquitous features of Haskell programs. Sometimes a function is called with arguments that are statically known to be...
Simon L. Peyton Jones
AFP
1995
Springer
126views Formal Methods» more  AFP 1995»
13 years 9 months ago
Functional Programming with Overloading and Higher-Order Polymorphism
The Hindley/Milner type system has been widely adopted as a basis for statically typed functional languages. One of the main reasons for this is that it provides an elegant comprom...
Mark P. Jones