Results 1 
5 of
5
A Modular Verifiable ExceptionHandling Mechanism
 ACM Transactions on Programming Languages and Systems
, 1985
"... This paper presents a new model for exception handling, called the replacement model. The replacement model, in contrast to other exceptionhandling proposals, supports all the handler responses of resumption, termination, retry, and exception propagation, within both statements and expressions, in ..."
Abstract

Cited by 22 (0 self)
 Add to MetaCart
This paper presents a new model for exception handling, called the replacement model. The replacement model, in contrast to other exceptionhandling proposals, supports all the handler responses of resumption, termination, retry, and exception propagation, within both statements and expressions, in a modular, simple, and uniform fashion. The model can be embedded in any expressionoriented language and can also be adapted to languages which are not expression oriented with almost all the above advantages. This paper presents the syntactic extensions for embedding the replacement model into Algol 68 and its operational semantics. An axiomatic semantic definition for the model can be found in [271. Categories and Subject Descriptors: D.3.3 [Programming Languages]: Language Constructsabstract
Static and Dynamic TypeChecking
 In Proc. of the Workshop on Database Programming Language& Roscoff France
, 1989
"... The purpose of a type checker is to prevent an incorrect operation from being performed. A static type checker does this by stopping the compiler from generating a program with type errors, a dynamic type checker halts the program as it is about to make a type error. It is clearly useless to have a ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
(Show Context)
The purpose of a type checker is to prevent an incorrect operation from being performed. A static type checker does this by stopping the compiler from generating a program with type errors, a dynamic type checker halts the program as it is about to make a type error. It is clearly useless to have a dynamic type checking system for a program which is to be produced, distributed and used by anyone other than the original authors since any type errors that occur would be meaningless to the user of the program. On the other hand, where a user is guiding a program through some data, a dynamic typechecking system is reasonable. Examples are browsing through a database or structureediting. Here typeerrors have meaning to the user. The ideal language would be basically statically typechecked but would allow dynamic typechecking when necessary. While this is possible with certain type systems there are others for which it is difficult. The implementation of dynamic type checking in various...
Thesis Dissertation "Exception Handling: The Case Against"
"... It has recently become apparent that only by striving for the utmost simplicity in programming languages can one hope to produce programs which express their semantics clearly. Thus it is essential to examine any new language feature to see if its contribution to ease of expression outweighs its cos ..."
Abstract
 Add to MetaCart
(Show Context)
It has recently become apparent that only by striving for the utmost simplicity in programming languages can one hope to produce programs which express their semantics clearly. Thus it is essential to examine any new language feature to see if its contribution to ease of expression outweighs its cost in terms of language complexity. This thesis examines exception handling mechanisms in this light. Such mechanisms are included in the programming languages PL/I, CLU and Ada, and extensive proposals have been made by Levin. A l l the mechanisms are &quot;highlevel &quot; in the sense that they can be simulated by conventional language features. Their designers offer only the vaguest indication of their range of applicability, and when the motivating examples are rewritten without exception handling there is
Algebraic curves and coding theory. Abuja 1990
, 2000
"... These notes are an extension of lectures given at the National Mathematical Centre in Abuja, Nigeria during the summer of 1990. They contain brief introductions to algebraic coding theory, the geometry of algebraic curves and class field theory of algebraic curves. Goppa’s method to contruct codes b ..."
Abstract
 Add to MetaCart
These notes are an extension of lectures given at the National Mathematical Centre in Abuja, Nigeria during the summer of 1990. They contain brief introductions to algebraic coding theory, the geometry of algebraic curves and class field theory of algebraic curves. Goppa’s method to contruct codes by means of linear systems on algebraic curves over finite fields is discussed. Bombieri’s proof of the Riemann hypothesis for curves is given. In the last sections some recent results on the number of points on curves over finite fields are discussed. These include work by Drinfeld, Ihara, Oesterlé, Serre and Vlădut. Finally we prove a new lower bound for the number of rational points a curve of high genus over F2 can have.