Domain-theoretic Foundations of Functional Programming

Domain-theoretic Foundations of Functional Programming (2006)

Cached

Download Links

[www.mathematik.tu-darmstadt.de]

by Thomas Streicher

Citations:

5 - 0 self

BibTeX

@MISC{Streicher06domain-theoreticfoundations,
    author = {Thomas Streicher},
    title = {Domain-theoretic Foundations of Functional Programming},
    year = {2006}
}

Bookmark

OpenURL

Abstract

Citations

997	The Lambda Calculus, its Syntax and Semantics - Barendregt - 1984
714	Theory of recursive functions and effective computability, McGraw-Hill - Rogers - 1967
369	Category Theory for Computing Science - Barr, Wells - 1990
202	The Formal Semantics of Programming Languages: An Introduction - Winskel - 1993
174	On full abstraction for pcf - Hyland, Ong - 2000
173	Full abstraction for PCF - Abramsky, Jagadeesan, et al. - 2000
52	First steps in synthetic domain theory - Hyland - 1488
47	Categories for the working mathematician (second edition - MacLane - 1998
46	Games and full abstraction for a functional metalanguage with recursive types. Distinguished Dissertation Series - McCusker - 1998
45	as a universal domain - Plotkin - 1978
42	Classical Logic, Continuation semantics and abstract machines - Streicher, Reus - 1998
38	Modèles complètement adéquats et stables des lambda-calculs typés. Thèse de Doctorat d’État, Université Paris VII - Berry - 1979
32	The fixed point property in synthetic domain theory - Taylor - 1991
31	Kripke logical relations and PCF - O’Hearn, Riecke - 1995
30	Reasoning about sequential functions via logical relations - Sieber - 1991
26	Fully abstract models of typed λ-calculi - Milner - 1977
13	A relational account of call-by-value sequentiality - Riecke, Sandholm - 1997
8	Computational adequacy for recursive types in models of intuitionistic set theory - Simpson
8	A universality theorem for PCF with recursive types, parallel-or and - Streicher - 1994
7	A Fully Abstract Model for Sequential Computation - Marz - 1999
7	Naive Synthetic Domain Theory—A Logical Approach - Reus, Streicher - 1994
6	When are two effectively given domains identical - Kanda, Park - 1979
6	On sequential functionals of type 3 - Normann
5	A type-theoretical alternative to ISWIM, CUCH, OWHY, Theoretical Computer Science 121 - Scott - 1993
5	Equationally fully abstract models of PCF - Stoughton - 1990
2	Stability and Computability in Coherent Domains - ASPERTI - 1990
2	Escardó PCF extended with real numbers: A domain-theoretic approach to higher-order exact real number computation - H - 1997
2	A universal realizability model for sequential computation - Rohr - 2002
2	Relating theories of the λ-calculus in To H. B. Curry: essays on combinatory logic, lambda calculus and formalism - Scott - 1980
1	Curien Domains and λCalculi - Amadio, P-L - 1998
1	Lindström and V. Stoltenberg-Hansen Mathematical Theory of Domains. Cambridge Univ - Griffor, I - 1994
1	de’Liguoro PCF definability via Kripke logical relations (after O’Hearn and - unknown authors - 1996
1	Finitary PCF is not decidable TCS - Loader - 2001
1	Sequentially Realizable Functionals APAL - Longley - 2002
1	LCF considered as a programming language TCS - Plotkin - 1977