Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Plotkin, Gordon D."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Cartesian closed categories of separable Scott domains
Andrej Bauer
,
Gordon D. Plotkin
,
Dana S. Scott
Theoretical Computer Science
546
, 2014, pp. 17-29
Some new directions in the syntax and semantics of formal languages
Gordon D. Plotkin
Lecture Notes in Computer Science
1872
, 2000, pp. 596-596
Countable non-determinism and uncountable limits
Pietro di Gianantonio
,
Furio Honsell
,
Silvia Liani
,
Gordon D. Plotkin
Lecture Notes in Computer Science
836
, 1994, pp. 130-145
A logical view of composition
MartÃn Abadi
,
Gordon D. Plotkin
Theoretical Computer Science
114
(1), 1993, pp. 3-30
Set-theoretical and other elementary models of the
\lambda
-calculus
Gordon D. Plotkin
Theoretical Computer Science
121
(1-2), 1993, pp. 351-409
On functors expressible in the polymorphic typed lambda calculus
John C. Reynolds
,
Gordon D. Plotkin
Information and Computation
105
(1), 1993, July, pp. 1-29