Sciweavers

TOOLS
1992
IEEE
14 years 18 days ago
Automating the Development of Syntax Tree Generators for an Evolving Language
This paper describes an Ei el system for rapid testing of grammars. Grammars are de ned in an extended BNF notation that allows actions on the parse tree nodes to be de ned as add...
Per Grape, Kim Walden
TOOLS
1992
IEEE
14 years 18 days ago
Write-ing Applications: Design of an Extensible Text Editor as an Application Framework
Using an object-oriented approach, the text editor Write has been designed to be extensible while its basic structure has been kept small and simple. As its main extension concept...
Clemens A. Szyperski
TOOLS
1992
IEEE
14 years 18 days ago
The Oberon System
We show how an object-oriented system-and in particular the Oberon System-can be used to write software that is extensible by end users even while the software is running. Extensib...
Hanspeter Mössenböck
TOOLS
1992
IEEE
14 years 18 days ago
Part Objects and their Location
The notion of location of part objects is introduced, yielding a reference to the containing object. Combined with locally defined objects and classes (block structure), singularl...
Ole Lehrmann Madsen, Birger Møller-Pedersen
FPCA
1989
14 years 18 days ago
Theorems for Free!
Parametric polymorphism constrains the behavior of pure functional programs in a way that allows the derivation of interesting theorems about them solely from their types, i.e., v...
Philip Wadler
FPCA
1989
14 years 18 days ago
Automatic Complexity Analysis
One way to analyse programs is to to derive expressions for their computational behaviour. A time bound function (or worst-case complexity) gives an upper bound for the computatio...
Mads Rosendahl