M. Hyland. A syntactic characterisation
of the Equality in
some Models of the Lambda Calculus.
Journal of the London Mathematical Society, 12, 1976, 361-370.
J. M. E. Hyland. A survey of some useful partial order
relations on terms of the Lambda Calculus.
In C. Bohm (editor),
Lambda Calculus and Computer Science Theory, Springer Lecture Notes in
Computer Science 37, 1976, 83-93.
R. O. Gandy and J. M. E. Hyland. Computable
and recursively countable functionals of higher type.
In R. O. Gandy and J. M. E. Hyland (editors),
Logic Colloquium 76, North-Holland, 1977, 407-438.
J. M. E. Hyland. Aspects of constructivity.
In R. O. Gandy and J. M. E. Hyland (editors),
Logic Colloquium 76, North-Holland, 1977, 407-438.
J. M. E. Hyland. The intrinsic recursion
theory on the countable or continuous functionals.
In J. E. Fenstad, R. O. Gandy and G. E. Sacks (editors),
Generalized Recursion Theory II, North-Holland, 1978, 135-145.
J. M. E. Hyland. Filter spaces and continuous
functionals
Annals of Mathematical Logic 16, 1979, 101-143.
M. P. Fourman and J. M. E. Hyland.
Sheaf models for analysis.
In M. P. Fourman, C. J. Mulvey and D. S. Scott (editors),
Applications of Sheaves, Springer Lecture Notes in
Mathematics 753, 1979, 280-301.
J. M. E. Hyland. Continuity in Spatial Toposes.
In M. P. Fourman, C. J. Mulvey and D. S. Scott (editors),
Applications of Sheaves, Springer Lecture Notes in
Mathematics 753, 1979, 442-465.
J. M. E. Hyland, P. T. Johnstone and A. M. Pitts.
Tripos Theory.
Mathematical Proceedings of the Cambridge Philosophical Society,
88, 1980, 205-232.
J. M. E. Hyland.
Function spaces in the category of Locales.
In B. Banaschewski and R.-E. Hoffmann (editors). Continuous Lattices,
Lecture Notes in Mathematics 871, Springer 1981, 264-281.
J. M. E. Hyland.
Applications of constructivity.
In L. J. Cohen, J. Los, H Pfeiffer and
K.-P. Podewski (editors). Logic Methodology and
Philosophy of Science VI,
North-Holland 1982, 145-152.
J. M. E. Hyland.
The Effective Topos.
In A.S. Troelstra and D van Dalen (editors). The L. E. J. Bouwer Centenary
Symposium, North-Holland 1982, 165-216.
(This is a version of the paper put into TeX by Evan Cavallo. He has taken
the opportunity to correct some misprints. I am grateful to him for making
his version available.)
J. M. E. Hyland. A small complete category.
Annals of Pure and Applied Logic 40, 1988, 135-165.
J. M. E. Hyland and A. M. Pitts. The Theory of
Constructions: Categorical Semantics and Topos Theoretic Models.
In J. W. Gray and A. Scedrov (editors), Categories in Computer
Science and Logic, Contemporary Mathematics 92, 1989, 137-199.
J. M. E. Hyland, E. P. Robinson and G. Rosolini.
The Discrete Objects in the Effective Topos.
Proceedings of the London Mathematical Society, (3) 60, 1990, 1-36.
J. M. E. Hyland, E. P. Robinson and G. Rosolini.
Algebraic Types in PER Models.
In M. Main, A. Melton, M.Mislove and D. Schmidt (editors),
Mathematical Foundations of Programming Language Semantics, Lecture
Notes in Computer Science 442, 1990, 330-350.
Martin Hyland and Valeria Paiva. Lineales.
In O que nos faz pensar, Departamento de Filosofia da PUC-RIO
(Pontificial Catholic University of Rio de Janeiro), 1991,
107-123.
J. M. E. Hyland. Computing and Foundations.
In J. H. Johnson and M. J. Loomis (editors),
The Mathematical Revolution Inspired
by Computing, Clarendon Press Oxford,
1991, 269-284.
J. M. E. Hyland. First steps in synthetic
domain theory.
In A. Carboni, M.-C. Pedicchio and G. Rosolini (editors),
Category Theory, Springer Lecture Notes in Mathematics 1488,
1991, 280-301.
Nick Benton, Gavin Bierman, Valeria de Paiva
and Martin Hyland. Term Assignment
for Intuitionistic Linear Logic.
University of Cambridge Computer Laboratory, Technical Report 262,
1992.
Nick Benton, Gavin Bierman, Valeria de Paiva and Martin Hyland.
A Term Calculus for
Intuitionistic Linear Logic.
In M. Bezem and J.F. Groote (editors).
Proceedings of the International Conference on
Typed Lambda Calculi and Applications, TLCA 93.
Lecture Notes in Computer Science 664, Springer-Verlag, 1993, 179-194.
J. M. E. Hyland and C.-H. L. Ong.
Modified Realizability Toposes and Strong
Normalization Proofs (Extended abstract).
In M. Bezem and J. F. Groote (editors). Proceedings of Typed Lambda
Calculus and Applications (TLCA 1993), Lecture Notes in
Computer Science 664,
Springer-Verlag, 1993, 179-194.
Martin Hyland and Valeria de Paiva.
Full Intuitionistic Logic (Extended Abstract).
Annals of Pure and Applied Logic, 64, 1993, 273-291.
Nick Benton, Gavin Bierman, Valeria de Paiva and Martin Hyland.
Linear Lambda Calculus and Categorical Models Revisited.
In E. Boerger, G. Jaeger, H. K. Buening S. Martini and M.M. Richter (editors).
Proceedings of Sixth Conference on Computer Science Logic,
CSL 93. Lecture notes in Computer Science 702, Springer-Verlag,
1993, 61-84.
J. M. E. Hyland and C.-H. L. Ong.
Pi-calculus, dialogue games and PCF.
In Proceedings of the 7th ACM Conference on Functional
Programming Languages and Computer Architecture (FPCA 1995),
ACM Press, 1995, 96-107.
J. M. E. Hyland and E. Moggi. The S-replete construction In D. Pitt, D. Rydeheard and P. Johnstone (editors). Category Theory and Computer Science, Lecture Notes in Computer Science 953, Springer-Verlag, 1995, 96-116.
Martin Hyland.
Game Semantics.
In A.M. Pitts and P.Dybjer (editors). Semantics of Logics and
Computation,
Publications of the Newton Institute, Cambridge University Press, 1997,
131-184.
(This is a scan from the book. I hope one day to produce a corrected
and updated version!)
Martin Hyland and Andrea Schalk.
Abstract Games for Linear Logic, Extended Abstract.
In M. Hofmann, G. Rosolini and D. Pavlovic (editors).
CTCS '99, Conference on Category theory and Computer Science.
Volume 29 of
Electronic Notes in Theoretical Computer Science, 29, 1999,
127-150.
Martin Hyland and John Power.
Symmetric Monoidal Sketches.
In Second International Conference on Principles and Practice
of Declarative Programming, 2000, 280-288.
J. M. E. Hyland and C.-H. L. Ong.
On Full Abstraction for PCF: I. Models,
observables and the full abstraction problem,
II. Dialogue games and innocent strategies,
III. A fully abstract and universal game model.
Information and Computation, 163, 2000, 285-408.