Sciweavers

357 search results - page 12 / 72
» A type system for higher-order modules
Sort
View
JAPLL
2006
87views more  JAPLL 2006»
13 years 7 months ago
Is ZF a hack?: Comparing the complexity of some (formalist interpretations of) foundational systems for mathematics
This paper presents Automath encodings (which also are valid in LF/P) of various kinds of foundations of mathematics. Then it compares these encodings according to their size, to f...
Freek Wiedijk
ICC
2007
IEEE
135views Communications» more  ICC 2007»
14 years 1 months ago
Soft Demapping and Iterative Decoding for Satellite Communications
— In this paper an original detection strategy for satellite digital broadcasting communications is defined; particularly, we consider the DVB-S2 system, which is proposed as a ...
Simone Morosi, Romano Fantacci, Enrico Del Re, Ros...
ECOOP
2003
Springer
14 years 23 days ago
A Nominal Theory of Objects with Dependent Types
We design and study νObj, a calculus and dependent type system for objects and classes which can have types as members. Type can be aliases, abstract types, or new types. The type...
Martin Odersky, Vincent Cremet, Christine Röc...
ENTCS
2002
128views more  ENTCS 2002»
13 years 7 months ago
Rewriting Calculus with(out) Types
The last few years have seen the development of a new calculus which can be considered as an outcome of the last decade of various researches on (higher order) term rewriting syst...
Horatiu Cirstea, Claude Kirchner, Luigi Liquori
TAPSOFT
1997
Springer
13 years 11 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