Sciweavers

212 search results - page 9 / 43
» Working with Mathematical Structures in Type Theory
Sort
View
POPL
2007
ACM
14 years 7 months ago
A very modal model of a modern, major, general type system
We present a model of recursive and impredicatively quantified types with mutable references. We interpret in this model all of the type constructors needed for typed intermediate...
Andrew W. Appel, Christopher D. Richards, Jé...
ICFP
2005
ACM
14 years 7 months ago
Type inference, principal typings, and let-polymorphism for first-class mixin modules
module is a programming abstraction that simultaneously generalizes -abstractions, records, and mutually recursive definitions. Although various mixin module type systems have bee...
Henning Makholm, J. B. Wells
ENTCS
2008
91views more  ENTCS 2008»
13 years 7 months ago
Implementing Real Numbers With RZ
RZ is a tool which translates axiomatizations of mathematical structures to program specifications using the realizability interpretation of logic. This helps programmers correctl...
Andrej Bauer, Iztok Kavkler
TELETRAFFIC
2007
Springer
14 years 1 months ago
A Phase-Type Based Markov Chain Model for IEEE 802.16e Sleep Mode and Its Performance Analysis
Abstract. To support battery powered mobile broadband wireless access devices efficiently, IEEE 802.16e defines a sleep mode operation for conserving the power of mobile terminals...
Zhisheng Niu, Yanfeng Zhu, Vilius Benetis
POPL
2003
ACM
14 years 7 months ago
Pure patterns type systems
We introduce a new framework of algebraic pure type systems in which we consider rewrite rules as lambda terms with patterns and rewrite rule application as abstraction applicatio...
Gilles Barthe, Horatiu Cirstea, Claude Kirchner, L...