Sciweavers

10289 search results - page 1900 / 2058
» Standard bases in K
Sort
View
WCRE
1993
IEEE
15 years 10 months ago
A Practical Program Transformation System for Reverse Engineering
Program transformation systems provide one means of formally deriving a program from its speci cation. The main advantage of this development method is that the executable program...
M. Ward, K. Bennett
STOC
2010
ACM
224views Algorithms» more  STOC 2010»
15 years 10 months ago
Satisfiability Allows No Nontrivial Sparsification Unless The Polynomial-Time Hierarchy Collapses
Consider the following two-player communication process to decide a language L: The first player holds the entire input x but is polynomially bounded; the second player is computa...
Holger Dell and Dieter van Melkebeek
IFIP
1994
Springer
15 years 10 months ago
Investigating the use of interactive hypermedia systems
There have been innumerable glowing reports of the way hypermedia systems allow users to explore and use vast amounts of information in ways not possible using traditional informa...
Peter Evans II
SC
1992
ACM
15 years 10 months ago
Willow: A Scalable Shared Memory Multiprocessor
We are currently developing Willow, a shared-memory multiprocessor whose design provides system capacity and performance capable of supporting over a thousand commercial microproc...
John K. Bennett, Sandhya Dwarkadas, Jay A. Greenwo...
FPCA
1989
15 years 10 months ago
A Simple Semantics for ML Polymorphism
We give a framework for denotational semantics for the polymorphic “core” of the programming language ML. This framework requires no more semantic material than what is needed...
Atsushi Ohori
« Prev « First page 1900 / 2058 Last » Next »