Debugging via run-time type checking

2000 ◽  
Vol 25 (1) ◽  
pp. 58
Author(s):  
Susan Horwitz
Keyword(s):  
Run Time ◽  
1992 ◽  
Vol 21 (382) ◽  
Author(s):  
Jens Palsberg

We have designed, implemented, and proved the correctness of a compiler generator that accepts action semantic descriptions of imperative programming languages. The generated compilers emit absolute code for an abstract RISC machine language that currently is assembled into code for the SPARC and the HP Precision Architecture. Our machine language needs no run-time type-checking and is thus more realistic than those considered in previous compiler proofs. We use solely algebraic specifications; proofs are given in the initial model.


1992 ◽  
Vol 14 (1-2) ◽  
pp. 31-69 ◽  
Author(s):  
Philip W. Dart ◽  
Justin Zobel

Author(s):  
Michael Burrows ◽  
Stephen N. Freund ◽  
Janet L. Wiener

1987 ◽  
Vol 16 (230) ◽  
Author(s):  
Ole Lehrmann Madsen

Programming languages that support the object-oriented perspective on programming may be divided into two groups. One group of languages originating from Simula follows the Algol tradition with respect to block structure, static name binding and compile-time type checking. Another group of languages originating from Smalltalk is more in the style of the Lisp tradition with a flat set of definitions (classes), dynamic name binding and run-time type checking. The purpose of this paper is to analyze the role of block structure in object-oriented languages. It will be demonstrated that block structure is useful from both a conceptual and technical viewpoint.


Author(s):  
Alexey Loginov ◽  
Suan Hsi Yong ◽  
Susan Horwitz ◽  
Thomas Reps
Keyword(s):  
Run Time ◽  

1999 ◽  
Vol 34 (3) ◽  
pp. 146-153
Author(s):  
Sheetal V. Kakkad ◽  
Mark S. Johnstone ◽  
Paul R. Wilson
Keyword(s):  
Run Time ◽  

1997 ◽  
Vol 3 (4) ◽  
pp. 317-345 ◽  
Author(s):  
JOSÉ M. GOÑI ◽  
JOSÉ C. GONZÁLEZ ◽  
ANTONIO MORENO

We present a lexical platform that has been developed for the Spanish language. It achieves portability between different computer systems and efficiency, in terms of speed and lexical coverage. A model for the full treatment of Spanish inflectional morphology for verbs, nouns and adjectives is presented. This model permits word formation based solely on morpheme concatenation, driven by a feature-based unification grammar. The run-time lexicon is a collection of allomorphs for both stems and endings. Although not tested, it should be suitable also for other Romance and highly inflected languages. A formalism is also described for encoding a lemma-based lexical source, well suited for expressing linguistic generalizations: inheritance classes, lemma encoding, morpho-graphemic allomorphy rules and limited type-checking. From this source base, we can automatically generate an allomorph indexed dictionary adequate for efficient retrieval and processing. A set of software tools has been implemented around this formalism: lexical base augmenting aids, lexical compilers to build run-time dictionaries and access libraries for them, feature manipulation libraries, unification and pseudo-unification modules, morphological processors, a parsing system, etc. Software interfaces among the different modules and tools are cleanly defined to ease software integration and tool combination in a flexible way. Directions for accessing our e-mail and web demonstration prototypes are also provided. Some figures are given, showing the lexical coverage of our platform compared to some popular spelling checkers.


1994 ◽  
Vol VII (3) ◽  
pp. 12-23 ◽  
Author(s):  
Shail Aditya ◽  
Christine H. Flood ◽  
James E. Hicks

Sign in / Sign up

Export Citation Format

Share Document