Sciweavers

479 search results - page 75 / 96
» The theory and calculus of aliasing
Sort
View
COMBINATORICS
2004
99views more  COMBINATORICS 2004»
15 years 6 months ago
A Fast Algorithm for MacMahon's Partition Analysis
This paper deals with evaluating constant terms of a special class of rational functions, the Elliott-rational functions. The constant term of such a function can be read off immed...
Guoce Xin
CORR
2010
Springer
84views Education» more  CORR 2010»
15 years 4 months ago
Termination Casts: A Flexible Approach to Termination with General Recursion
This paper proposes a type-and-effect system called Teq, which distinguishes terminating terms and total functions from possibly diverging terms and partial functions, for a lambd...
Aaron Stump, Vilhelm Sjöberg, Stephanie Weiri...
QEST
2010
IEEE
15 years 4 months ago
The Measurable Space of Stochastic Processes
Abstract--We introduce a stochastic extension of CCS endowed with structural operational semantics expressed in terms of measure theory. The set of processes is organised as a meas...
Luca Cardelli, Radu Mardare
ICFP
2005
ACM
16 years 6 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
BIRTHDAY
2004
Springer
15 years 11 months ago
Pure Type Systems in Rewriting Logic: Specifying Typed Higher-Order Languages in a First-Order Logical Framework
Abstract. The logical and operational aspects of rewriting logic as a logical framework are tested and illustrated in detail by representing pure type systems as object logics. Mor...
Mark-Oliver Stehr, José Meseguer