Sciweavers

2880 search results - page 90 / 576
» Types are calling conventions
Sort
View
LOPSTR
2004
Springer
15 years 10 months ago
Graph-Based Proof Counting and Enumeration with Applications for Program Fragment Synthesis
For use in earlier approaches to automated module interface adaptation, we seek a restricted form of program synthesis. Given some typing assumptions and a desired result type, we ...
J. B. Wells, Boris Yakobowski
TLCA
2001
Springer
15 years 9 months ago
The Implicit Calculus of Constructions
In this paper, we introduce a new type system, the Implicit Calculus of Constructions, which is a Curry-style variant of the Calculus of Constructions that we extend by adding an i...
Alexandre Miquel
DBKDA
2010
IEEE
219views Database» more  DBKDA 2010»
15 years 5 months ago
GN-DTD: Graphical Notations for Describing XML Documents
— This paper presents a graphical approach to model XML documents based on a Data Type Documentation called Graphical Notations-Data Type Documentation (GN-DTD). GN-DTD allows us...
Zurinahni Zainol, Bing Wang
133
Voted
ENTCS
2006
120views more  ENTCS 2006»
15 years 5 months ago
Timers for Distributed Systems
We deal with temporal aspects of distributed systems, introducing and studying a new model called timed distributed -calculus. This model extends distributed -calculus with timers...
Gabriel Ciobanu, Cristian Prisacariu
ENTCS
2007
100views more  ENTCS 2007»
15 years 5 months ago
Lightweight Static Capabilities
We describe a modular programming style that harnesses modern type systems to verify safety conditions in practical systems. This style has three ingredients: (i) A compact kernel...
Oleg Kiselyov, Chung-chieh Shan