WorldCat Identities

Hyland, John Martin Elliott

Overview
Works: 14 works in 39 publications in 2 languages and 432 library holdings
Genres: Conference papers and proceedings 
Roles: Editor, Author, Opponent, 958, 956
Publication Timeline
.
Most widely held works by John Martin Elliott Hyland
Logic Colloquium 76 : proceedings of a conference held in Oxford in July 1976 by Logic Colloquium. 1976. Oxford( Book )

21 editions published between 1976 and 1977 in 3 languages and held by 279 WorldCat member libraries worldwide

Algebraic types in PER models by Martin Hyland( Book )

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

Recursion Theory on the Countable Functionals by J. M. E Hyland( Book )

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

Proceedings of a conference by Oxford) Logic Colloquium (1976( Book )

1 edition published in 1977 in English and held by 1 WorldCat member library worldwide

Science speaking right or remaining silent by Martin Hyland( Book )

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

Eighth Games for Logic and Programming Languages Workshop (GaLoP) special issue by GaLoP( Book )

1 edition published in 2016 in English and held by 1 WorldCat member library worldwide

Provability, Computability and Reflection by Lev Dmitrievich Beklemishev( Book )

1 edition published in 1977 in English and held by 1 WorldCat member library worldwide

Provability, Computability and Reflection
Structures concurrentes en sémantique des jeux by Simon Castellan( )

1 edition published in 2017 in English and held by 1 WorldCat member library worldwide

Game semantics is an effective tool to study and model abstractly programming languages from a mathematical point of view, by keeping enough concrete information on the structure of programs but yet leaving aside superfluous details. During my PhD thesis, I worked on merging game semantics with event structures to propose truly concurrent denotational models of higher-order concurrent languages. In the first part, I build a model based on this merge, retaining enough information about the behaviour of programs to interpret adequately a large variety of concurrent programming languages for various notions of convergence. The construction of this model is based on the introduction of symmetry to prove that the model is indeed in a cartesian-closed category. In the second part, I propose a generalization, in this setting, of innocence and well-bracketing, key notions in game semantics to understand the computational effects, and thusly closing openproblems of game semantics about concurrent and nondeterministic innocence.In the last part, I propose an interpretation in this model of concurrent languages with weak shared memory, one of the first works of denotational semantics for these kinds of languages. Althoughtheoretical, these models are compositional and based on partial orders, and thus could permit scaling verification of concurrent programs (an important problem of the domain)
On Forcing and Classical Realizability by Lionel Rieg( )

1 edition published in 2014 in English and held by 1 WorldCat member library worldwide

Cette thèse s'intéresse à la correspondance de Curry-Howard classique et son interaction avec le forcing de Cohen, en s'appuyant sur les outils de la réalisabilité classique. Dans une première partie, nous commençons par une introduction générale à la réalisabilité classique dans PA2, avec pour fil directeur l'extraction de témoin. Cette introduction couvre la description de la machine abstraite de Krivine (KAM), la construction des modèles, la réalisation de l'arithmétique et les deux principales problématiques calculatoires : la spécification et l'extraction de témoin. Pour illustrer la flexibilité de ce cadre, nous montrons ensuite qu'il s'adapte sans effort à diverses extensions : l'ajout d'instructions supplémentaires dans la KAM ou l'introduction de types de données primitifs tels que les entiers, les rationnels et les réels. Ces divers travaux ont été formalisés dans l'assistant de preuves Coq.Dans une seconde partie, nous redéfinissons ce cadre à l'ordre supérieur et le comparons à PA2. Ce changement, nécessaire pour exprimer pleinement la transformation de forcing, uniformise la théorie et permet d'intégrer tous les types de données. Nous présentons ensuite le forcing en réalisabilité classique, initialement dû à Krivine, puis l'étendons aux filtres génériques, lorsque les conditions de forcing forment un type de données. Cela permet de relire le forcing comme une transformation de programmes, dans le but d'obtenir des réalisateurs plus efficaces plutôt que des résultats d'indépendance. Cette méthode est illustrée notamment par l'exemple du théorème de Herbrand, dont la preuve par forcing donne un programme nettement plus efficace que la preuve habituelle
Logic colloquium : proceedings, 1976, Oxford( Book )

1 edition published in 1977 in English and held by 1 WorldCat member library worldwide

Shaves. Fibered categories. Categorical logic and type theory by G Rosolini( Book )

1 edition published in 1999 in English and held by 1 WorldCat member library worldwide

106 years of comedy! : 3rd annual one-act festival( Visual )

1 edition published in 2001 in English and held by 1 WorldCat member library worldwide

Studies in Logic and the Foundations of Mathematics, 87 : Provability, Computability and Reflection. Symposium Proceedings by R. O Gandy( )

1 edition published in 1977 in English and held by 0 WorldCat member libraries worldwide

Measurement of neutron orbit sizes from the study of the sub-coulomb -t, d- reaction by Martin Hyland( Book )

1 edition published in 1977 in English and held by 0 WorldCat member libraries worldwide

 
moreShow More Titles
fewerShow Fewer Titles
Audience Level
0
Audience Level
1
  Kids General Special  
Audience level: 0.67 (from 0.54 for Studies in ... to 1.00 for Measuremen ...)

Logic Colloquium 76 : proceedings of a conference held in Oxford in July 1976Studies in Logic and the Foundations of Mathematics, 87 : Provability, Computability and Reflection. Symposium Proceedings
Alternative Names
Hyland, J. M. E.

Hyland, John Martin Elliott

Hyland, Martin

Martin Hyland British mathematician

Martin Hyland matematico britannico

Languages
Covers
Studies in Logic and the Foundations of Mathematics, 87 : Provability, Computability and Reflection. Symposium Proceedings