Sciweavers

570 search results - page 49 / 114
» A Core Calculus of Dependency
Sort
View
TYPES
2004
Springer
15 years 5 months ago
Extracting a Normalization Algorithm in Isabelle/HOL
We present a formalization of a constructive proof of weak normalization for the simply-typed λ-calculus in the theorem prover Isabelle/HOL, and show how a program can be extracte...
Stefan Berghofer
FSTTCS
2006
Springer
15 years 3 months ago
Game Semantics for Higher-Order Concurrency
Abstract. We describe a denotational (game) semantics for a call-byvalue functional language with multiple threads of control, which may communicate values of general type on local...
James Laird
PE
2008
Springer
114views Optimization» more  PE 2008»
14 years 11 months ago
Buffer overflow asymptotics for multiplexed regulated traffic
By characterizing the worst case profile, which maximizes the content of a buffer fed with leaky bucket regulated flows in packet telecommunication networks, we derive a tight upp...
Yu Ying, Fabrice Guillemin, Ravi Mazumdar, Catheri...
CORR
2008
Springer
94views Education» more  CORR 2008»
14 years 10 months ago
Semi-continuous Sized Types and Termination
A type-based approach to termination uses sized types: an ordinal bound for the size of a data structure is stored in its type. A recursive function over a sized type is accepted i...
Andreas Abel
POPL
2010
ACM
15 years 9 months ago
Integrating Typed and Untyped Code in a Scripting Language
Many large software systems originate from untyped scripting language code. While good for initial development, the lack of static type annotations can impact code-quality and per...
Francesco Zappa Nardelli, Jan Vitek, Johan Ös...