Sciweavers

432 search results - page 49 / 87
» Type Inference for COBOL Systems
Sort
View
TAPSOFT
1997
Springer
13 years 12 months ago
An Applicative Module Calculus
The SML-like module systems are small typed languages of their own. As is, one would expect a proof of their soundness following from a proof of subject reduction. Unfortunately, t...
Judicaël Courant
CADE
1990
Springer
13 years 11 months ago
IMPS: An Interactive Mathematical Proof System
imps is an Interactive Mathematical Proof System intended as a general purpose tool for formulating and applying mathematics in a familiar fashion. The logic of imps is based on a...
William M. Farmer, Joshua D. Guttman, F. Javier Th...
MABS
2000
Springer
13 years 11 months ago
The Use of Models - Making MABS More Informative
g of target systems attempted but rather an abstraction of the target systems is modelled and insights bout the abstraction then applied back to the target systems. The MABS modell...
Bruce Edmonds
EMSOFT
2005
Springer
14 years 1 months ago
Synchronization of periodic clocks
We propose a programming model dedicated to real-time videostreaming applications for embedded media devices, including highdefinition TVs. This model is built on the synchronous...
Albert Cohen, Marc Duranton, Christine Eisenbeis, ...
POPL
2005
ACM
14 years 8 months ago
Parametric polymorphism for XML
Despite the extensiveness of recent investigations on static typing for XML, parametric polymorphism has rarely been treated. This well-established typing discipline can also be u...
Haruo Hosoya, Alain Frisch, Giuseppe Castagna