Sciweavers

2333 search results - page 207 / 467
» Recursive Computational Depth
Sort
View
BIRTHDAY
2006
Springer
15 years 10 months ago
Eliminating Dependent Pattern Matching
Abstract. This paper gives a reduction-preserving translation from Coquand's dependent pattern matching [4] into a traditional type theory [11] with universes, inductive types...
Healfdene Goguen, Conor McBride, James McKinna
CONCUR
2006
Springer
15 years 10 months ago
Liveness, Fairness and Impossible Futures
Impossible futures equivalence is the semantic equivalence on labelled transition systems that identifies systems iff they have the same "AGEF" properties: temporal logic...
Rob J. van Glabbeek, Marc Voorhoeve
AFP
1995
Springer
125views Formal Methods» more  AFP 1995»
15 years 10 months ago
Merging Monads and Folds for Functional Programming
Abstract. These notes discuss the simultaneous use of generalised fold operators and monads to structure functional programs. Generalised fold operators structure programs after th...
Erik Meijer, Johan Jeuring
FCT
1995
Springer
15 years 10 months ago
Fast Algorithms for Maintaining Shortest Paths in Outerplanar and Planar Digraphs
Abstract. We present algorithms for maintaining shortest path information in dynamic outerplanar digraphs with sublogarithmic query time. By choosing appropriate parameters we achi...
Hristo Djidjev, Grammati E. Pantziou, Christos D. ...
MOC
2000
137views more  MOC 2000»
15 years 6 months ago
The apolar bilinear form in geometric modeling
Some recent methods of Computer Aided Geometric Design are related to the apolar bilinear form, an inner product on the space of homogeneous multivariate polynomials of a fixed deg...
Gert Vegter