Gordon, Michael J. C. 1948
Overview
Works:  72 works in 167 publications in 3 languages and 1,608 library holdings 

Genres:  Juvenile works Pictorial works Conference papers and proceedings 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
)
19 editions published between 1979 and 1987 in English and held by 473 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 machineindependent 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
19 editions published between 1979 and 1987 in English and held by 473 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 machineindependent 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
)
9 editions published between 1977 and 1979 in English and held by 315 WorldCat member libraries worldwide
9 editions published between 1977 and 1979 in English and held by 315 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 286 WorldCat member libraries worldwide
15 editions published between 1988 and 1992 in English and held by 286 WorldCat member libraries worldwide
Introduction to HOL : a theorem proving environment for higher order logic(
Book
)
5 editions published in 1993 in English and held by 159 WorldCat member libraries worldwide
5 editions published in 1993 in English and held by 159 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 ApplicationsHOL '92 by International workshop on higher order logic theorem proving and its applications(
Book
)
12 editions published between 1992 and 2001 in English and held by 76 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
12 editions published between 1992 and 2001 in English and held by 76 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 18 WorldCat member libraries worldwide
A picture book which introduces the concept of smell. Suggested level: junior
3 editions published between 1994 and 2004 in English and Greek, Modern and held by 18 WorldCat member libraries worldwide
A picture book which introduces the concept of smell. Suggested level: junior
Mechanized reasoning and hardware design(
Book
)
4 editions published in 1992 in English and held by 12 WorldCat member libraries worldwide
4 editions published in 1992 in English and held by 12 WorldCat member libraries worldwide
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
5 editions published in 1988 in English and held by 9 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
6 editions published in 1973 in English and Undetermined and held by 8 WorldCat member libraries worldwide
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
1 edition published in 1989 in English and held by 8 WorldCat member libraries worldwide
Towards a semantic theory of dynamic binding by
Michael Gordon(
Book
)
2 editions published in 1975 in English and held by 7 WorldCat member libraries worldwide
2 editions published in 1975 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
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 6 WorldCat member libraries worldwide
Presents ideas and activities that use what kids already know to help them learn more about their sense of taste
2 editions published between 1994 and 2001 in English and held by 6 WorldCat member libraries worldwide
Presents ideas and activities that use what kids already know to help them learn more about their sense of taste
Why higherorder logic is a good formalism for specifying and verifying hardware by
Michael J. C Gordon(
Book
)
4 editions published in 1985 in English and held by 6 WorldCat member libraries worldwide
4 editions published in 1985 in English and held by 6 WorldCat member libraries worldwide
Sight by
Mandy Suhr(
Book
)
2 editions published between 1994 and 2004 in Greek, Modern and English and held by 6 WorldCat member libraries worldwide
A picture book introducing the basic concepts of sight
2 editions published between 1994 and 2004 in Greek, Modern and English and held by 6 WorldCat member libraries worldwide
A picture book introducing the basic concepts of sight
Hearing by
Mandy Suhr(
Book
)
2 editions published between 1994 and 2004 in Greek, Modern and English and held by 5 WorldCat member libraries worldwide
Presents ideas and activities that use what kids already know to help them learn more about their sense of hearing
2 editions published between 1994 and 2004 in Greek, Modern and English and held by 5 WorldCat member libraries worldwide
Presents ideas and activities that use what kids already know to help them learn more about their sense of hearing
Merging HOL with set theory by
Michael J. C Gordon(
Book
)
3 editions published in 1994 in English and held by 5 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 typechecking that are wellknown 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 ZFlike 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 settheoretic definitional theories. These approaches are illustrated with two examples: the construction of lists and a simple lemma in group theory."
3 editions published in 1994 in English and held by 5 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 typechecking that are wellknown 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 ZFlike 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 settheoretic definitional theories. These approaches are illustrated with two examples: the construction of lists and a simple lemma in group theory."
Bu shi wo zuo de = It wasn't me! by
Brian Moses(
Book
)
1 edition published in 2010 in Chinese and held by 5 WorldCat member libraries worldwide
1 edition published in 2010 in Chinese and held by 5 WorldCat member libraries worldwide
Programming combinations of deduction and BDDbased 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 BDDbased 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."
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 BDDbased 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."
Combining the Hol98 proof assistant with the BuDDy BDD package by
Michael J. C Gordon(
Book
)
2 editions published in 1999 in English and held by 4 WorldCat member libraries worldwide
Abstract: "Theorem provers descended from LCF allow their users to write complex proof tools with high assurance that false theorems will not be proved. This report describes an experimental system that extends the LCF approach to enable combinations of deduction and BDDbased symbolic calculation to be programmed with a similar assurance. The deduction is supplied by the Hol98 system and the BDD algorithms by Jrn LindNielsen's BuDDy package. The main idea is to provide LCFstyle support to a set of inference rules for judgements pt [deducible from][right arrow] b, where p is an orderinducing map from HOL variables to BDD variables, t is a HOL term and b is a BDD. A single oracle rule allows a HOL theorem [deducible from] t to be deduced from pt [deducible from][right arrow] TRUE. This report is intended to serve as documentation for the Hol98 library HolBddLib. It is partly an exposition of standard results, partly tutorial and partly an account of research in combining deduction and symbolic state enumeration."
2 editions published in 1999 in English and held by 4 WorldCat member libraries worldwide
Abstract: "Theorem provers descended from LCF allow their users to write complex proof tools with high assurance that false theorems will not be proved. This report describes an experimental system that extends the LCF approach to enable combinations of deduction and BDDbased symbolic calculation to be programmed with a similar assurance. The deduction is supplied by the Hol98 system and the BDD algorithms by Jrn LindNielsen's BuDDy package. The main idea is to provide LCFstyle support to a set of inference rules for judgements pt [deducible from][right arrow] b, where p is an orderinducing map from HOL variables to BDD variables, t is a HOL term and b is a BDD. A single oracle rule allows a HOL theorem [deducible from] t to be deduced from pt [deducible from][right arrow] TRUE. This report is intended to serve as documentation for the Hol98 library HolBddLib. It is partly an exposition of standard results, partly tutorial and partly an account of research in combining deduction and symbolic state enumeration."
more
fewer
Audience Level
0 

1  
Kids  General  Special 
Related Identities
Useful Links
Associated Subjects
Anxiety Anxiety in children Apologizing Automatic theorem proving Binary control systems Computable functions Computable functionsData processing Computer architecture Computer science Computer software Deductive databases Dinosaurs Ear Edinburgh LCF (Computer system) Emotions in children Eye Health Hearing Honesty LISP (Computer program language) Logic Logic, Symbolic and mathematical Logic designData processing Logic programming Mathematical statistics MicroprocessorsComputeraided design ML (Computer program language) Nose Operations research Programming languages (Electronic computers) Programming languages (Electronic computers)Semantics Semantics Senses and sensation Set theory Smell Sound Taste Tongue Toy and movable books Truthfulness and falsehood Vision Worry Worry in children
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.... mathmaticien
Michael John Caldwell Gordon
Languages
Covers