-
1
-
Some observations about the nature of computer science
-
13
-
Essential intersection type assignment
-
24
-
Label-selective λ-calculus syntax and confluence
-
41
-
Conventional and uniqueness typing in graph rewrite systems
-
52
-
A meta-language for typed object-oriented languages
-
72
-
Preemption in concurrent systems
-
94
-
Local versus non-local computation of length of digitized curves
-
104
-
Data-independences of parallel random access machines
-
114
-
Proving termination of logic programs by transforming them into equivalent term rewriting systems
-
125
-
Completeness of hierarchical combinations of term rewriting systems
-
139
-
Higher-order and semantic unification
-
151
-
A conservative extension of first-order logic and its applications to theorem proving
-
161
-
Well-founded Ordered Search (extended abstract)
-
173
-
A real-time interval logic and its decision procedure
-
193
-
On the semantics of optimization predicates in CLP languages
-
205
-
Incremental algorithms for constraint solving and entailment over rational trees
-
218
-
Proximity problems and the Voronoi diagram on a rectilinear plane with rectangular obstacles
-
228
-
Feasibility of design in stereolithography
-
238
-
Compact location problems
-
248
-
On some communication complexity problems related to threshold functions
-
260
-
Recursiveness over the complex numbers is time-bounded
-
268
-
A lower bound for solvability of polynomial equations
-
284
-
Reuse of proofs in software verification
-
294
-
Induce-statements and induce-expressions: Constructs for inductive programming
-
306
-
A graphic language based on timing diagrams
-
317
-
Software technology: Integrating theory and practice
-
318
-
Generating degrees of belief from statistical information: An overview
-
326
-
Complexity results for 1-safe nets
-
338
-
Some results about logical descriptions of non deterministic behaviours
-
348
-
Order structures and generalisations of Szpilrajn's theorem
-
358
-
ICSP and its relationship with ACSP and CSP
-
373
-
On reduction-based process semantics
-
388
-
Keeping track of the latest gossip: Bounded time-stamps suffice
-
400
-
Time optimal self-stabilizing spanning tree algorithms
-
411
-
Efficient algorithm to sort linear combinations of arrays
-
419
-
A simple file structure for the weighted dictionary problem
-
436
-
Searching, sorting and randomised algorithms for Central Elements and ideal counting in posets
-
444
-
Learning classes of Regular and Linear Languages in Valiant's learnability framework
