J. M. E. Hyland

13 papers B 1Journal 7Unranked 4
YearRankTypeTitle / Venue / Authors
2025 J jnl
The Kock-Mikkelsen factorisation.
Math. Struct. Comput. Sci.
J. M. E. Hyland
2017 J jnl
Classical lambda calculus in modern dress.
Math. Struct. Comput. Sci.
J. M. E. Hyland
2016 — ch.
The Forgotten Turing.
The Once and Future Turing
J. M. E. Hyland
2014 J jnl
Elements of a theory of algebraic theories.
Theor. Comput. Sci.
J. M. E. Hyland
2002 J jnl
Proof theory in the abstract.
Ann. Pure Appl. Log.
J. M. E. Hyland
2002 J jnl
Variations on Realizability: Realizing the Propositional Axiom of Choice.
Math. Struct. Comput. Sci.
J. M. E. Hyland
2000 J jnl
On Full Abstraction for PCF: I, II, and III.
Inf. Comput.
J. M. E. Hyland, C.-H. Luke Ong
1995 — conf
Pi-Calculus, Dialogue Games and PCF.
FPCA
J. M. E. Hyland, C.-H. Luke Ong
1995 — conf
The S-Replete Constuction.
Category Theory and Computer Science
J. M. E. Hyland, Eugenio Moggi
1993 — conf
Modified Realizability Toposes and Strong Normalization Proofs.
TLCA
J. M. E. Hyland, C.-H. Luke Ong
1989 B conf
Algebraic Types in PER Models.
Mathematical Foundations of Programming Semantics
J. M. E. Hyland, Edmund P. Robinson, Giuseppe Rosolini
1988 J jnl
A small complete category.
Ann. Pure Appl. Log.
J. M. E. Hyland
1975 — conf
A survey of some useful partial order relations on terms of the lambda calculus.
Lambda-Calculus and Computer Science Theory
J. M. E. Hyland