Sciweavers

1368 search results - page 149 / 274
» Recursive modules for programming
Sort
View
ICALP
2001
Springer
15 years 11 months ago
An Axiomatic Approach to Metareasoning on Nominal Algebras in HOAS
We present a logical framework Υ for reasoning on a very general class of languages featuring binding operators, called nominal , presented in higher-order abstract syntax (HOAS)....
Furio Honsell, Marino Miculan, Ivan Scagnetto
ICCL
1998
IEEE
15 years 10 months ago
Modular Compilers Based on Monad Transformers
The monadic style of language speci cation has the advantages of modularity and extensibility: it is simple to add or change features in an interpreter to re ect modi cations in t...
William L. Harrison, Samuel N. Kamin
LCTRTS
1999
Springer
15 years 10 months ago
Live Memory Analysis for Garbage Collection in Embedded Systems
Real-time garbage collection is essential if object-oriented languages (in particular, Java) are to become predictable enough for real-time embedded systems. Although techniques f...
Patrik Persson
TYPES
1998
Springer
15 years 10 months ago
Metatheory of Verification Calculi in LEGO - To what Extent Does Syntax Matter?
Investigating soundness and completeness of verification calculi for imperative programming languages is a challenging task. Incorrect results have been published in the past. We t...
Thomas Kleymann
HPDC
1996
IEEE
15 years 10 months ago
Mobile Processing in Open Systems
A universal spatial automaton, called WAVE, for highly parallel processing in arbitrary distributed systems is described. The automaton is based on a virus principle where recursi...
Peter Sapaty