Exceptional syntax

@article{Benton2001ExceptionalS,
  title={Exceptional syntax},
  author={Nick Benton and Andrew J. Kennedy},
  journal={Journal of Functional Programming},
  year={2001},
  volume={11},
  pages={395 - 410}
}
From the points of view of programming pragmatics, rewriting and operational semantics, the syntactic construct used for exception handling in ML-like programming languages, and in much theoretical work on exceptions, has subtly undesirable features. We propose and discuss a more well-behaved construct. 
Semantics of an effect analysis for exceptions
TLDR
The semantics is defined using partial equivalence relations over a standard monadic, domain-theoretic model of the original language and establishes the correctness of the analysis itself and of the contextual program transformations that it enables. Expand
Compiling with continuations, continued
We present a series of CPS-based intermediate languages suitable for functional language compilation, arguing that they have practical benefits over direct-style languages based on A-normal form (A...
Syntax and Semantics for Operations with Scopes
TLDR
A categorical model of abstract syntax with so-called scoped operations, based on what Ghani et al. call the monad of explicit substitutions, defined using the initial-algebra semantics in the category of endofunctors, and a new kind of multi-sorted algebras, called scoped alge bras, which serve as interpretations of syntax with scopes. Expand
Rewriting Conversions Implemented with Continuations
  • Michael Norrish
  • Mathematics, Computer Science
  • Journal of Automated Reasoning
  • 2009
TLDR
This work gives a continuation-based implementation of rewriting for systems in the LCF tradition that improves performance on large terms, and on long-running computations. Expand
IMP with exceptions over decorated logic
  • Burak Ekici
  • Computer Science, Mathematics
  • Discret. Math. Theor. Comput. Sci.
  • 2018
In this paper, we facilitate the reasoning about impure programming languages, by annotating terms with "decorations" that describe what computational (side) effect evaluation of a term may involve.Expand
Monads and Effects
TLDR
The course presents typed metalanguages for monads and related categorical notions, and then describes how they can be further refined by introducing effects. Expand
Certification of programs with computational effects
TLDR
This thesis proves that the decorated theory for the global states as well as two decorated theories for exceptions are syntactically complete relatively to their pure sublogics, certified in Coq as applications of the authors' generic frameworks. Expand
Extracting the Range of cps from Affine Typing
Increasing degrees of reasoning about programs are being mechanized, and hence more formality is needed. Here we present an instance of this formalization in the form of a precise characterization ofExpand
Exception Handlers as Extensible Cases
TLDR
This paper proposes the first practical proposal for integrating exceptions into the type system of a higher-order language, and describes an implicitly typed external language EL where well-typed programs do not raise any unhandled exceptions. Expand
Compiling with continuations, continued
We present a series of CPS-based intermediate languages suitable for functional language compilation, arguing that they have practical benefits over direct-style languages based on A-normal formExpand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 32 REFERENCES
ML for the working programmer
TLDR
In teaching the methods of functional programming, how to program in Standard ML, a functional language recently developed at Edinburgh University, the author shows how to use such concepts as lists, trees, higher-order functions and infinite data structures. Expand
A Syntactic Approach to Type Soundness
TLDR
A new approach to proving type soundness for Hindley/Milner-style polymorphic type systems by an adaptation of subject reduction theorems from combinatory logic to programming languages and the use of rewriting techniques for the specification of the language semantics is presented. Expand
Proofs and types
Sense, denotation and semantics natural deduction the Curry-Howard isomorphism the normalisation theorem Godel's system T coherence spaces denotational semantics of T sums in natural deduction systemExpand
Monads, Effects and Transformations
TLDR
A typed compiler intermediate language, MIL-lite, which incorporates computational types refined with effect information, is defined by using Howe's method to prove a ciu theorem for the language in terms of a termination predicate defined directly on the term. Expand
Computational Types from a Logical Perspective
TLDR
This paper shows that the computational lambda calculus also arises naturally as the term calculus corresponding to a novel intuitionistic modal propositional logic and gives natural deduction, sequent calculus and Hilbert-style presentations of this logic and proves strong normalisation and confluence results. Expand
A Computational Interpretation of the lambda-µ-Calculus
TLDR
This paper proposes a simple computational interpretation of Parigot's λΜ-calculus as a single-step semantics which leads to a relatively simple, but powerful, operational theory. Expand
Parametric Polymorphism and Operational Equivalence
  • A. Pitts
  • Computer Science, Mathematics
  • Electron. Notes Theor. Comput. Sci.
  • 1997
TLDR
An operationally-based approach to Reynolds' notion of relational parametricity is developed for an extension of Plotkin's PCF with ∀types and lazy lists and the resulting logical relation is shown to be a useful tool for proving properties of polymorphic types up to a notion of operational equivalence based on Morris-style contextual equivalence. Expand
The Revised Report on the Syntactic Theories of Sequential Control and State
TLDR
This paper develops fully compatible equational theories of the same imperative higher-order programming languages that subsume the original calculi of control and state and satisfy the usual Church–Rosser and Standardization Theorems. Expand
Notions of Computation and Monads
  • E. Moggi
  • Computer Science, Mathematics
  • Inf. Comput.
  • 1991
TLDR
Calculi are introduced, based on a categorical semantics for computations, that provide a correct basis for proving equivalence of programs for a wide range of notions of computation. Expand
A Transformation-Based Optimiser for Haskell
TLDR
This paper reports on the practical experience of the transformational approach to compilation, in the context of a substantial compiler. Expand
...
1
2
3
4
...