Sciweavers

2362 search results - page 61 / 473
» Programming in Standard ML
Sort
View
250
Voted
POPL
2004
ACM
16 years 3 months ago
Polymorphic typed defunctionalization
Defunctionalization is a program transformation that aims to turn a higher-order functional program into a first-order one, that is, to eliminate the use of functions as first-cla...
François Pottier, Nadji Gauthier
113
Voted
POPL
1998
ACM
15 years 7 months ago
A Functional Representation of Data Structures with a Hole
Data structures with a hole, in other words data structures with an uninitialized field, are useful to write efficient programs: they enable us to construct functional data stru...
Yasuhiko Minamide
141
Voted
GPCE
2008
Springer
15 years 4 months ago
Typing communicating component assemblages
Building complex component-based software architectures can lead to subtle assemblage errors. In this paper, we introduce a typesystem-based approach to avoid message handling err...
Michael Lienhardt, Alan Schmitt, Jean-Bernard Stef...
FSEN
2009
Springer
15 years 10 months ago
Program Logics for Sequential Higher-Order Control
We introduce a Hoare logic for higher-order functional languages with control operators such as callcc. The key idea is to build the assertion language and proof rules around an e...
Martin Berger
116
Voted
FUIN
2006
85views more  FUIN 2006»
15 years 3 months ago
Implementing Typeful Program Transformations
The notion of program transformation is ubiquitous in programming language studies on interpreters, compilers, partial evaluators, etc. In order to implement a program transformat...
Chiyan Chen, Rui Shi, Hongwei Xi