Sciweavers

TLCA
2007
Springer
15 years 6 months ago
The Safe Lambda Calculus
William Blum, C.-H. Luke Ong
72
Voted
TLCA
2007
Springer
15 years 6 months ago
Strong Normalization and Equi-(Co)Inductive Types
e type system for the l—m˜d—E™—l™ulus enri™hed with re™urE sive —nd ™ore™ursive fun™tions over equiEindu™tive —nd E™oindu™tive types is presented in whi™h —ll wel...
Andreas Abel
TLCA
2007
Springer
15 years 6 months ago
Embedding Pure Type Systems in the Lambda-Pi-Calculus Modulo
The lambda-Pi-calculus allows to express proofs of minimal predicate logic. It can be extended, in a very simple way, by adding computation rules. This leads to the lambda-Pi-calcu...
Denis Cousineau 0002, Gilles Dowek
TLCA
2007
Springer
15 years 6 months ago
Polynomial Size Analysis of First-Order Functions
We present a size-aware type system for first-order shapely function definitions. Here, a function definition is called shapely when the size of the result is determined exactly...
Olha Shkaravska, Ron van Kesteren, Marko C. J. D. ...
94
Voted
TLCA
2007
Springer
15 years 6 months ago
Continuation-Passing Style and Strong Normalisation for Intuitionistic Sequent Calculi
Abstract. The intuitionistic fragment of the call-by-name version of Curien and Herbelin’s λµ˜µ-calculus is isolated and proved strongly normalising by means of an embedding ...
José Espírito Santo, Ralph Matthes, ...
132
Voted
TLCA
2007
Springer
15 years 6 months ago
Completing Herbelin's Programme
Abstract. In 1994 Herbelin started and partially achieved the programme of showing that, for intuitionistic implicational logic, there is a Curry-Howard interpretation of sequent c...
José Espírito Santo
STACS
2007
Springer
15 years 6 months ago
New Approximation Algorithms for Minimum Cycle Bases of Graphs
We consider the problem of computing an approximate minimum cycle basis of an undirected non-negative edge-weighted graph G with m edges and n vertices; the extension to directed ...
Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Mich...
75
Voted
STACS
2007
Springer
15 years 6 months ago
Quantum Network Coding
Masahito Hayashi, Kazuo Iwama, Harumichi Nishimura...
STACS
2007
Springer
15 years 6 months ago
The Complexity of Unions of Disjoint Sets
This paper is motivated by the open question whether the union of two disjoint NPcomplete sets always is NP-complete. We discover that such unions retain much of the complexity of...
Christian Glaßer, Alan L. Selman, Stephen D....
STACS
2007
Springer
15 years 6 months ago
Pure Stationary Optimal Strategies in Markov Decision Processes
Markov decision processes (MDPs) are controllable discrete event systems with stochastic transitions. Performances of an MDP are evaluated by a payoff function. The controller of ...
Hugo Gimbert