• Home
  • Search
  • A refinement calculus for nondeterministic expressions
  • Cite Icon20
  • https://doi.org/10.14264/192541Copy DOI Icon

A refinement calculus for nondeterministic expressions

Show More
  • Abstract
  • Literature Map
  • Citations
  • Similar Papers
Abstract

This thesis presents a refinement calculus for transforming highly abstract specifications into programs written in a functional programming language. Refinement calculi allow the derivation of a program from a formal specification by a sequence of correctness-preserving transformation steps. Most refinement calculi target imperative programming languages. Functional programming languages are often more expressive than imperative programming languages. This expressive power leads to a reduced gap between the concepts used to express a problem (as a specification) and the concepts used to express its solution (as a program). Thus, a refinement calculus which targets a functional programming language can lead to a simpler development process which produces a final product more quickly. We build a refinement calculus for functional programs by adding specification constructs to a functional language and examining transformations over the resulting language.This thesis complements other work in the area in two major ways. Firstly, we investigate the addition of truly-nondeterministic, rather than underdetermined, choice constructs to a functional language. These constructs allow specifications which are more abstract and which admit more implementations. Secondly, most refinement calculi for functional programs add erratic choice constructs to a functional language. We investigate the addition of both demonic and angelic nondeterminism to a functional language. Demonic and erratic choice are similar: given a number of alternatives, they choose any one. In contrast, given a number of alternatives angelic choice always makes the correct choice, if one exists. Angelic choice is difficult to reason about, but allows the concise specification of powerful parallel constructs.

Similar Papers
  • PDF
  • Research Article
  • Citations1

Artificial Intelligence in the American Healthcare Industry: Looking Forward to 2030

  • Oct 06, 2022
  • Journal of Medical Research and Surgery
  • Federico R Tewes
  • Book Chapter
  • Citations24

A fibrational semantics for logic programs

  • Jan 01, 1996
  • Y Kinoshita +1
  • Supplementary Content

Co-Contextual Type Systems: Contextless Deductive Reasoning for Correct Incremental Type Checking

  • Mar 02, 2020
  • TUbilio (Technical University of Darmstadt)
  • Edlira Kuci
  • Book Chapter

Chapter 1 - SQL Is Declarative, Not Procedural

  • Jan 01, 2008
  • Joe Celko's Thinking in Sets: Auxiliary, Temporal, and Virtual Tables in SQL
  • Joe Celko
  • Book Chapter
  • Citations3

Typed object-oriented functional programming with late binding

  • Jan 01, 1996
  • Zhenyu Qian +1
  • Conference Article
  • Citations15

Ct

  • Oct 04, 2007
  • Anwar Ghuloum
  • Conference Article
  • Citations1

Developing a monadic type checker for an object-oriented language: an experience report

  • Oct 20, 2019
  • Elias Castegren +1
  • Book Chapter
  • Citations2

Falafel: Arrays in a Functional Language

  • Jan 01, 1991
  • Carl McCrosky +2
  • Conference Article

Databases and Programming

  • Jan 14, 2015
  • Peter Buneman
  • Conference Instance
  • Citations3

Proceedings of the 13th ACM SIGPLAN international conference on Functional programming

  • Sep 20, 2008
  • Book Chapter
  • Citations1

Learning small programs with additional information

  • Jan 01, 1997
  • Rüsiņš Freivalds +3
  • Research Article
  • Citations5

Promoting rewriting to a programming language: a compiler for non-deterministic rewrite programs in associative-commutative theories

  • Mar 01, 2001
  • Journal of Functional Programming
  • Kirchnerhélène +1
  • Conference Article
  • Citations9

Efficient compilation of linear recursive functions into object level loops

  • Jul 01, 1986
  • Peter Harrison +1
  • Research Article
  • Citations14

Should ML be Object-Oriented?

  • Jul 01, 2002
  • Formal Aspects of Computing
  • David Macqueen
  • Conference Article
  • Citations1

Real-time capabilities in functional languages

  • Apr 12, 2016
  • Jeffrey C Murphy +2
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.