Algebraic specification

M Wirsing - Formal models and semantics, 1990 - Elsevier
Publisher Summary An algebraic specification is a description of one or more abstract data
types. There are three main semantic approaches to algebraic specifications:(1) the initial …

Behavioral interface specification languages

J Hatcliff, GT Leavens, KRM Leino, P Müller… - ACM Computing …, 2012 - dl.acm.org
Behavioral interface specification languages provide formal code-level annotations, such as
preconditions, postconditions, invariants, and assertions that allow programmers to express …

[LIBRO][B] A calculus of communicating systems

R Milner - 1980 - Springer
In CCS, non-determinate behaviours (in sane sense of detexminacy) are the rule rather than
the exception. The outcome-or even the capability-of future observations may not be …

[LIBRO][B] The formal semantics of programming languages: an introduction

G Winskel - 1993 - books.google.com
The Formal Semantics of Programming Languages provides the basic mathematical
techniques necessary for those who are beginning a study of the semantics and logics of …

[PDF][PDF] The theory and practice of concurrency

A Roscoe - 1998 - ora.ox.ac.uk
Since CAR Hoare's text Communicating Sequential Processes was published in 1985, his
notation has been extensively used for teaching and applying concurrency theory. This book …

[LIBRO][B] Implementing mathematics

RL Constable, SF Allen, HM Bromley, WR Cleaveland… - 1986 - academia.edu
We hope to accomplish four things by writing this book. Our rst goal is to o er a tutorial on the
new mathematical ideas which underlie our research. In doing so we have tried to provide …

[LIBRO][B] Practical foundations for programming languages

R Harper - 2016 - books.google.com
This text develops a comprehensive theory of programming languages based on type
systems and structural operational semantics. Language concepts are precisely defined by …

Event structures

G Winskel - Advanced course on Petri nets, 1986 - Springer
Event structures are a model of computational processes. They represent a process as a set
of event occurrences with relations to express how events causally depend on others. This …

Full abstraction in the lazy lambda calculus

S Abramsky, CHL Ong - Information and Computation, 1993 - Elsevier
A theory of lazy λ-calculus is developed as a basis for lazy functional programming
languages. This is motivated by a mismatch between the" standard"(ie, sensible) theory of …

[LIBRO][B] Nominal sets: Names and symmetry in computer science

AM Pitts - 2013 - books.google.com
Nominal sets provide a promising new mathematical analysis of names in formal languages
based upon symmetry, with many applications to the syntax and semantics of programming …