Sciweavers

535 search results - page 12 / 107
» Do we need dependent types
Sort
View
POPL
2004
ACM
14 years 7 months ago
A type system for well-founded recursion
In the interest of designing a recursive module extension to ML that is as simple and general as possible, we propose a novel type system for general recursion over effectful expr...
Derek Dreyer
TPHOL
2002
IEEE
14 years 14 days ago
Type-Theoretic Functional Semantics
We describe the operational and denotational semantics of a small imperative language in type theory with inductive and recursive definitions. The operational semantics is given b...
Yves Bertot, Venanzio Capretta, Kuntal Das Barman
DCC
2008
IEEE
14 years 7 months ago
A Lower Bound on the Redundancy of Arithmetic-Type Delay Constrained Coding
In a previous paper we derived an upper bound on the redundancy of an arithmetic-type encoder for a memoryless source, designed to meet a finite endto-end strict delay constraint....
Eado Meron, Ofer Shayevitz, Meir Feder, Ram Zamir
PADS
1997
ACM
13 years 11 months ago
Optimistic Distributed Simulation Based on Transitive Dependency Tracking
In traditional optimistic distributed simulation protocols, a logical process(LP) receiving a straggler rolls back and sends out anti-messages. Receiver of an anti-message may als...
Om P. Damani, Yi-Min Wang, Vijay K. Garg
APSEC
2004
IEEE
13 years 11 months ago
Accurate Call Graph Extraction of Programs with Function Pointers Using Type Signatures
Software engineers need to understand programs in order to effectively maintain them. The call graph, which presents the calling relationships between functions, is a useful repre...
Darren C. Atkinson