Sciweavers

828 search results - page 13 / 166
» types 2000
Sort
View
ENTCS
2000
80views more  ENTCS 2000»
14 years 9 months ago
The simply typed rewriting calculus
The rewriting calculus is a rule construction and application framework. As such it embeds in a uniform way term rewriting and lambda-calculus. Since rule application is an explic...
Horatiu Cirstea, Claude Kirchner
COLING
2000
14 years 11 months ago
Incremental Identification of Inflectional Types
We present an al)proach to the increnmntal accrual of lexical int'ornmtion fl)r unknown words t;hat is consl;raint-based and conll)atil)le with s(.andard unification-liased g...
Petra Barg, James Kilbury
JACM
2000
119views more  JACM 2000»
14 years 9 months ago
A minimum spanning tree algorithm with Inverse-Ackermann type complexity
A deterministic algorithm for computing a minimum spanning tree of a connected graph is presented. Its running time is O(m (m, n)), where is the classical functional inverse of Ack...
Bernard Chazelle
SIAMAM
2000
119views more  SIAMAM 2000»
14 years 9 months ago
The "Linear" Limit of Thin Film Flows as an Obstacle-Type Free Boundary Problem
We study the limit as n 0 of the nonnegative, self-similar source-type solutions of the thin film equation ut + (unuxxx)x = 0. We obtain a unique limiting function u, which is a s...
Fernando Quirós, Francisco Bernis, Josephus...
ESOP
2000
Springer
15 years 1 months ago
Secure Information Flow as Typed Process Behaviour
Abstract. We propose a new type discipline for the -calculus in which secure information flow is guaranteed by static type checking. Secrecy levels are assigned to channels and are...
Kohei Honda, Vasco Thudichum Vasconcelos, Nobuko Y...