WorldCat Identities

Gordon, Michael J. C. 1948-

Overview
Works: 68 works in 194 publications in 6 languages and 1,760 library holdings
Genres: Juvenile works  Conference papers and proceedings  Pictorial works  Fiction  Picture books 
Roles: Author, Editor
Classifications: QA76.7, 001.6424
Publication Timeline
.
Most widely held works by Michael J. C Gordon
The denotational description of programming languages : an introduction by Michael J. C Gordon( Book )

20 editions published between 1979 and 1987 in English and held by 470 WorldCat member libraries worldwide

1. Introduction.- 1.1. Syntax, semantics and pragmatics.- 1.2. The purposes of formal semantics.- 1.2.1. Providing precise and machine-independent concepts.- 1.2.2. Providing unambiguous specification techniques.- 1.2.3. Providing a rigorous theory to support reliable reasoning.- 1.3. Denotational semantics.- 1.4. Abstract entities and their description.- 2. A first example: the language TINY.- 2.1. Informal syntax of TINY.- 2.2. Informal semantics of TINY.- 2.2.1. Informal semantics of expressions.- 2.2.2. Informal semantics of commands.- 2.3. An example.- 2.4. Formal semantics of TINY.- 2.4
Edinburgh LCF : a mechanised logic of computation by Michael J. C Gordon( Book )

27 editions published between 1977 and 1979 in 4 languages and held by 340 WorldCat member libraries worldwide

Programming language theory and its implementation : applicative and imperative paradigms by Michael J. C Gordon( Book )

15 editions published between 1988 and 1992 in English and held by 287 WorldCat member libraries worldwide

Introduction to HOL : a theorem proving environment for higher order logic( Book )

3 editions published in 1993 in English and held by 154 WorldCat member libraries worldwide

Higher order logic theorem proving and its applications : proceedings of the IFIP TC10/WG10.2 International Workshop on Higher Order Logic Theorem Proving and Its Applications--HOL '92 by IFIP TC 10/WG 10.2 International Workshop on Higher Order Logic Theorem Proving and Its Applications( Book )

13 editions published between 1992 and 1993 in English and held by 77 WorldCat member libraries worldwide

The HOL system is a higher order logic theorem proving system implemented at Edinburgh University, Cambridge University and INRIA. Its many applications, from the verification of hardware designs at all levels to the verification of programs and communication protocols are considered in depth in this volume. Other systems based on higher order logic, namely Nuprl and LAMBDA are also discussed. Features given particular consideration are: novel developments in higher order logic and its implementations in HOL; formal design and verification methodologies for hardware and software; public domain availability of the HOL system. Papers addressing these issues have been divided as follows: Mathematical Logic; Induction; General Modelling and Proofs; Formalizing and Modelling of Automata; Program Verification; Hardware Description Language Semantics; Hardware Verification Methodologies; Simulation in Higher Order Logic; Extended Uses of Higher Order Logic. Academic and industrial researchers involved in formal hardware and software design and verification methods should find the publication especially interesting and it is hoped it will also provide a useful reference tool for those working at software institutes and within the electronics industries
Smell by Mandy Suhr( Book )

3 editions published between 1994 and 2004 in English and Greek, Modern and held by 21 WorldCat member libraries worldwide

A picture book which introduces the concept of smell. Suggested level: junior
Mechanizing programming logics in higher order logic by Michael J. C Gordon( Book )

5 editions published in 1988 in English and held by 9 WorldCat member libraries worldwide

Operational reasoning and denotational semantics by Michael J. C Gordon( Book )

5 editions published in 1975 in English and held by 8 WorldCat member libraries worldwide

Obviously true properties of programs can be hard to prove when meanings are specified with a denotational semantics. One cause of this is that such a semantics usually abstracts away from the running process - thus properties which are obvious when one thinks about this lose the basis of their obviousness in the absence of it. To enable process-based intuitions to be used in constructing proofs one can associate with the semantics an abstract interpreter so that reasoning about the semantics can be done by reasoning about computations on the interpreter. This technique is used to prove several facts about a semantics of pure LISP. First a denotational semantics and an abstract interpreter are described. Then it is shown that the denotation of any LISP form is correctly computed by the interpreter. This is used to justify an inference rule - called LISP-induction - which formalises induction on the size of computations on the interpreter. Finally LISP-induction is used to prove a number of results. In particular it is shown that the function eval is correct relative to the semantics - i.e. that it denotes a mapping which maps forms (coded as S-expressions) on to their correct values. (Author)
Towards a semantic theory of dynamic binding by Michael J. C Gordon( Book )

4 editions published in 1975 in English and held by 8 WorldCat member libraries worldwide

The results in this paper contribute to the formulation of a semantic theory of dynamic binding (fluid variables). The axioms and theorems are language independent in that they don't talk about programs - i.e. syntactic objects - but just about elements in certain domains. Firstly the equivalence (in the circumstances where it's true) of 'tying a knot' through the environment (elaborated in the paper) and taking a least fixed point is shown. This is central in proving the correctness of LISP eval type interpreters. Secondly the relation which must hold between two environments if a program is to have the same meaning in both is established. It is shown how the theory can be applied to LISP to yield previously known facts. (Author)
Fascinating facts about dinosaurs : a flap book full of surprises! by S Cassin( Book )

1 edition published in 1989 in English and held by 8 WorldCat member libraries worldwide

Evaluation and denotation of pure LISP programs : a worked example in semantics by Michael J. C Gordon( )

6 editions published in 1973 in English and Undetermined and held by 8 WorldCat member libraries worldwide

Dui bu qi = Excuse me by Brian Moses( Book )

3 editions published between 2010 and 2011 in Chinese and held by 7 WorldCat member libraries worldwide

It wasn't me : learning about honesty by Brian Moses( Book )

2 editions published between 2006 and 2010 in Chinese and Vietnamese and held by 7 WorldCat member libraries worldwide

Introduces children to the value of being honest through looking at everyday situations. Includes notes for parents and teachers. Suggested level: junior, primary
"Ill do it!" : taking responsibility by Brian Moses( Book )

2 editions published between 2006 and 2010 in Chinese and Vietnamese and held by 7 WorldCat member libraries worldwide

Uses everyday situations to explain what it means to be a responsible person. Suggested level: junior, primary
Why higher-order logic is a good formalism for specifying and verifying hardware by Michael J. C Gordon( Book )

5 editions published in 1985 in English and held by 7 WorldCat member libraries worldwide

I'm worried by Brian Moses( Book )

2 editions published between 2004 and 2012 in Greek, Modern and held by 7 WorldCat member libraries worldwide

Looks at ways children can learn to cope with feelings of fear and anxiety. Suggested level: junior, primary
Taste by Mandy Suhr( Book )

2 editions published between 1994 and 2001 in English and held by 7 WorldCat member libraries worldwide

A picture book introducing the basic concepts of taste
Merging HOL with set theory : preliminary experiments by Michael J. C Gordon( Book )

4 editions published in 1994 in English and held by 7 WorldCat member libraries worldwide

Abstract: "Set theory is the standard foundation for mathematics, but the majority of general purpose mechanized proof assistants support versions of type theory (higher order logic). Examples include Alf, Automath, Coq, Ehdm, HOL, IMPS, Lambda, LEGO, Nuprl, PVS and Veritas. For many applications type theory works well and provides, for specification, the benefits of type-checking that are well-known in programming. However, there are areas where types get in the way or seem unmotivated. Furthermore, most people with a scientific or engineering background already know set theory, whereas type theory may appear inaccessable [sic] and so be an obstacle to the uptake of proof assistants based on it. This paper describes some experiments (using HOL) in combining set theory and type theory; the aim is to get the best of both worlds in a single system. Three approaches have been tried, all based on an axiomatically specified type V of ZF-like sets: (i) HOL is used without any additions besides V; (ii) an embedding of the HOL logic into V is provided; (iii) HOL axiomatic theories are not automatically translated into set-theoretic definitional theories. These approaches are illustrated with two examples: the construction of lists and a simple lemma in group theory."
A metalanguage for interactive proof in LCF by Michael J. C Gordon( Book )

5 editions published between 1977 and 1978 in English and held by 7 WorldCat member libraries worldwide

Programming combinations of deduction and BDD-based symbolic calculation by Michael J. C Gordon( Book )

2 editions published in 1999 in English and held by 5 WorldCat member libraries worldwide

Abstract: "Theorem provers descended from LCF allow their users to write complex proof tools that provide high assurance that false theorems will not be proved. This paper describes some experiments in extending the 'LCF approach' to enable BDD-based symbolic algorithms to be programmed with a similar assurance. The deduction is supplied by the HOL system and the BDD algorithms by the BuDDy package."
 
moreShow More Titles
fewerShow Fewer Titles
Audience Level
0
Audience Level
1
  Kids General Special  
Audience level: 0.65 (from 0.43 for Taste / ... to 0.82 for Evaluation ...)

Edinburgh LCF : a mechanised logic of computation
Alternative Names
Gordon, M. J.

Gordon, M. J. C.

Gordon, M. J. C. 1948-

Gordon, M. J. C. (Michael J. C.), 1948-

Gordon, Michael J.

Gordon, Mike 1948-

Gordon, Mike 1948 February 28-

Gordon Mike 1948-.... mathématicien

Michael John Caldwell Gordon

Languages
Covers
Introduction to HOL : a theorem proving environment for higher order logicSmellTaste