Semantics of algorithmic languages

DOI10.1007/BF01101651zbMATH Open0554.68006MaRDI QIDQ760200FDOQ760200

Authors: Nikolay N. Nepeivoda 

Publication date: 1984

Published in: Journal of Soviet Mathematics (Search for Journal in Brave)

zbMATH Keywords

surveysemantics of programming languages

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Specification and verification (program logics, model checking, etc.) (68Q60) Semantics in the theory of computing (68Q55)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Effective Transformations on Probabilistic Data
• Title not available (Why is that?)
• Title not available (Why is that?)
• Axioms for user-defined operators
• Verification Decidability of Presburger Array Programs
• Formalization of correctness of recursive definitions
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A Comparison of the Axiomatic and Functional Models of Structured Programming
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Program Development as a Formal Activity
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Methods for specifying static semantics
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Specifying the Semantics of while Programs: A Tutorial and Critique of a Paper by Hoare and Lauer
• Title not available (Why is that?)
• Title not available (Why is that?)
• Analysis and synthesis of structured parallel programs
• Title not available (Why is that?)
• Program construction by refinements preserving correctness
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• An axiomatic basis for proving total correctness of goto-programs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On Interpreter-Oriented Definitions of Programming Languages
• Title not available (Why is that?)
• Models for recursion theory
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Primitive recursive algebraic theories and program schemes
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Correct Computation Rules for Recursive Languages
• On the Definition of Computable Function of a Real Variable
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Lucid—A Formal System for Writing and Proving Programs
• Parallel programming: An axiomatic approach
• Title not available (Why is that?)
• Title not available (Why is that?)
• Functional combination
• Formal semantics of a SNOBOL4 subset
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Safe programming
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Extensions and implementations of abstract data type specifications
• The Logic of Computer Programming
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• An Approach to Formal Definitions and Proofs of Programming Principles
• Program Optimization Using Invariants
• A Complete and Consistent Hoare Axiomatics for a Simple Programming Language
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Recursion theory on processes
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• SEMANOL (73), a metalanguage for programming the semantics of programming languages
• LCF considered as a programming language
• Title not available (Why is that?)
• An axiomatic basis for computer programming
• Title not available (Why is that?)
• The Semantics of Predicate Logic as a Programming Language
• A Powerdomain Construction
• Soundness and Completeness of an Axiom System for Program Verification
• Communicating sequential processes
• Title not available (Why is that?)
• Title not available (Why is that?)
• An order-algebraic definition of knuthian semantics
• Title not available (Why is that?)
• Title not available (Why is that?)
• Proving the correctness of regular deterministic programs: A unifying survey using dynamic logic
• Title not available (Why is that?)
• The Relation between Computational and Denotational Properties for Scott’s ${\text{D}}_\infty $-Models of the Lambda-Calculus
• Programming Language Constructs for Which It Is Impossible To Obtain Good Hoare Axiom Systems
• Title not available (Why is that?)
• A Transformation System for Developing Recursive Programs
• Algorithm = logic + control
• Power domains
• Programming with Verification Conditions
• Title not available (Why is that?)
• Title not available (Why is that?)
• LAR: A logic of algorithmic reasoning
• Inference Rules for Program Annotation
• Synthesis: Dreams → Programs
• Algorithm classification through synthesis
• Theory of program structures: Schemes, semantics, verification
• Program invariants as fixedpoints
• Title not available (Why is that?)
• Title not available (Why is that?)
• Some Properties of Predicate Transformers
• Can programming be liberated from the von Neumann style?
• The denotational semantics of programming languages
• The Semantics of Call-By-Value and Call-By-Name in a Nondeterministic Environment
• Semantics of nondeterminism, concurrency, and communication
• Computability concepts for programming language semantics
• Formal computations of non deterministic recursive program schemes
• Title not available (Why is that?)
• Title not available (Why is that?)
• Verifying Program Performance
• Is “sometime” sometimes better than “always”?
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Expressibility of functionals in D. Scott's LCF language
• More on advice on structuring compilers and proving them correct
• Subgoal induction
• Title not available (Why is that?)
• Title not available (Why is that?)
• Final algebra semantics and data type extensions
• Derivation of Logic Programs
• A mathematical semantics for a nondeterministic typed lambda-calculus
• Transformations of structures: An algebraic approach
• Logic and programming languages
• Horn clause computability
• The optimal approach to recursive programs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A class of functions synthesized from a finite number of examples and a lisp program scheme
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Proof of the characteristics of programs containing procedures and conditional operators
• An automatic system of logical deduction
• Remarks on R. D. Tennent's Language design methods based on semantic principles: Algol 68, a language designed using semantic principles
• Hierarchical program specification and verification - a many-sorted logical approach
• A method of describing programming languages
• Nondeterministic flowchart programs with recursive procedures: Semantics and correctness. I
• Description of language projections
• Bunch theory: A simple set theory for computer science
• Nondeterministic flowchart programs with recursive procedures: Semantics and correctness. II
• A simple relation between relational and predicate transformer semantics for nondeterministic programs
• Presburger arithmetic with array segments
• An approach to the construction of a universal language schema. semantics
• A closer look at termination
• A characterization of weakest preconditions
• What is an abstract datatype?
• Making computational sense of Montague's intensional logic
• On removing the machine from the language
• On an equivalence between continuation and stack semantics
• Proof rules for the programming language Euclid
• Formal derivation of strongly correct concurrent programs
• Data types, abstract data types and their specification problem
• The calculus of functional systems and parallel algorithms
• Correctness and equivalence of programs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Semantic specification using two-level grammars: Blocks, procedures and parameters
• Title not available (Why is that?)

Cited In (3)

• Semantics-to-Syntax Analyses of Algorithms
• Title not available (Why is that?)
• Revised report on the algorithmic language scheme

Uses Software

• ALGOL 68
• Refal
• SEMANOL

This page was built for publication: Semantics of algorithmic languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q760200)