-
Notifications
You must be signed in to change notification settings - Fork 0
/
bibliography.bib
157 lines (139 loc) · 7.4 KB
/
bibliography.bib
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
@article{church_1936,
ISSN = {00029327, 10806377},URL = {http://www.jstor.org/stable/2371045}, author = {Alonzo Church}, journal = {American Journal of Mathematics}, number = {2}, pages = {345--363}, publisher = {Johns Hopkins University Press}, title = {An Unsolvable Problem of Elementary Number Theory}, volume = {58}, year = {1936}
}
@article{turing_1937, title={Computability and $\lambda$-definability}, volume={2}, DOI={10.2307/2268280}, number={4}, journal={The Journal of Symbolic Logic}, publisher={Cambridge University Press}, author={Turing, A. M.}, year={1937}, pages={153–163}}
@article{curry_1930,
ISSN = {00029327, 10806377},
URL = {http://www.jstor.org/stable/2370619},
author = {H. B. Curry},
journal = {American Journal of Mathematics},
number = {3},
pages = {509--536},
publisher = {Johns Hopkins University Press},
title = {Grundlagen der Kombinatorischen Logik},
volume = {52},
year = {1930}
}
@article{church_1940, title={A formulation of the simple theory of types}, volume={5}, DOI={10.2307/2266170}, number={2}, journal={The Journal of Symbolic Logic}, publisher={Cambridge University Press}, author={Church, Alonzo}, year={1940}, pages={56–68}}
@article{tait_1967, title={Intensional interpretations of functionals of finite type I}, volume={32}, DOI={10.2307/2271658}, number={2}, journal={Journal of Symbolic Logic}, publisher={Cambridge University Press}, author={Tait, W. W.}, year={1967}, pages={198–212}}
@techreport{milner_1973,
title={Models of LCF.},
author={Robin Milner},
year={1973},
url={https://api.semanticscholar.org/CorpusID:117118678}
}
@article{milner_1977,
title = {Fully abstract models of typed $\lambda$-calculi},
journal = {Theoretical Computer Science},
volume = {4},
number = {1},
pages = {1-22},
year = {1977},
issn = {0304-3975},
doi = {https://doi.org/10.1016/0304-3975(77)90053-6},
url = {https://www.sciencedirect.com/science/article/pii/0304397577900536},
author = {Robin Milner},
abstract = {A semantic interpretation A for a programming language L is fully abstract if, whenever A〚C[M]〛⊑A〚C[N]〛 for two program phrases M,N and for all program contexts C[ ], it follows that A〚M〛⊑A〚N〛. A model M for the language is fully abstract if the natural interpretation A of L in M is fully abstract. We show that under certain conditions there exists, for an extended typed λ-calculus, a unique fully abstract model.}
}
@article{plotkin_1977,
title = {LCF considered as a programming language}, journal = {Theoretical Computer Science}, volume = {5}, number = {3}, pages = {223-255}, year = {1977}, issn = {0304-3975}, doi = {https://doi.org/10.1016/0304-3975(77)90044-5}, url = {https://www.sciencedirect.com/science/article/pii/0304397577900445}, author = {G.D. Plotkin}
}
@article{loader_1996,
title = {Finitary PCF is not decidable},
journal = {Theoretical Computer Science},
volume = {266},
number = {1},
pages = {341-364},
year = {1996},
issn = {0304-3975},
doi = {https://doi.org/10.1016/S0304-3975(00)00194-8},
url = {https://www.sciencedirect.com/science/article/pii/S0304397500001948},
author = {Ralph Loader},
keywords = {PCF, Decidability, Lambda calculus, Full abstraction},
}
@inproceedings{cartwright_1992,
author = {Cartwright, Robert and Felleisen, Matthias}, title = {Observable Sequentiality and Full Abstraction}, year = {1992}, isbn = {0897914538}, publisher = {Association for Computing Machinery}, address = {New York, NY, USA}, url = {https://doi.org/10.1145/143165.143232}, doi = {10.1145/143165.143232}, booktitle = {Proceedings of the 19th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages}, pages = {328–342}, numpages = {15}, location = {Albuquerque, New Mexico, USA}, series = {POPL '92}
}
@article{laird_2007,
title = "On the expressiveness of affine programs with non-local control: the elimination of nesting in SPCF", author = "Laird, {James D.}", year = "2007", volume = "77", pages = "511--531", journal = "Fundamenta Informaticae", issn = "0169-2968", publisher = "IOS Press", number = "4",
}
@book{Jones, journal={Abstract Syntax Tree Implementation Idioms}, author={Jones, joel}}
@article{jones_2003,
added-at = {2009-07-16T11:15:30.000+0200},
author = {Jones, Joel},
biburl = {https://www.bibsonomy.org/bibtex/2a86095c92a9801ab24d2196d334abe46/gwpl},
institution = {Department of Computer Science at University of Alabama},
interhash = {8354ebeb83ea5fb769e016686e0e79aa},
intrahash = {a86095c92a9801ab24d2196d334abe46},
journal = {Pattern Languages of Program Design},
keywords = {mgr todo_tags},
note = {Proceedings of the 10th Conference on Pattern Languages of Programs (PLoP2003)},
timestamp = {2009-07-16T11:15:30.000+0200},
title = {Abstract Syntax Tree Implementation Idioms},
url = {http://hillside.net/plop/plop2003/Papers/Jones-ImplementingASTs.pdf},
year = 2003
}
@inproceedings{Liang1995MonadTA,
title={Monad transformers and modular interpreters},
author={Sheng Liang and Paul Hudak and Mark P. Jones},
booktitle={ACM-SIGACT Symposium on Principles of Programming Languages},
year={1995},
url={https://api.semanticscholar.org/CorpusID:1424753}
}
@InProceedings{kanneganti_1993,
author="Kanneganti, Ramarao
and Cartwright, Robert
and Felleisen, Matthias",
editor="de Bakker, J. W.
and de Roever, W. -P.
and Rozenberg, G.",
title="SPCF: its model, calculus, and computational power",
booktitle="Semantics: Foundations and Applications",
year="1993",
publisher="Springer Berlin Heidelberg",
address="Berlin, Heidelberg",
pages="318--347",
abstract="SPCF is an idealized sequential programming language, based on Plotkin's language PCF, that permits programmers and programs to observe the evaluation order of procedures. In this paper, we construct a fully abstract model of SPCF using a new mathematical framework suitable for defining fully abstract models of sequential functional languages. Then, we develop an extended typed $\lambda$-calculus to specify the operational semantics of SPCF and show that the calculus is complete for the constant-free sub-language. Finally, we prove that SPCF is computationally complete: it can express all the computable (recursively enumerable) elements in its fully abstract model.",
isbn="978-3-540-47595-8"
}
@phdthesis{Winskel1980EventsIC,
author={Glynn Winskel},
title={Events in computation},
school = {The University of Edinburgh},
year={1980},
url={https://api.semanticscholar.org/CorpusID:19679577}
}
@book{curry1958combinatory,
title={Combinatory Logic},
author={Curry, H.B. and Feys, R. and Craig, W. and Hindley, J.R. and Seldin, J.P.},
number={v. 65, pt. 2},
isbn={9780720422085},
lccn={a59001593},
series={Combinatory Logic},
url={https://books.google.co.uk/books?id=BdoozgEACAAJ},
year={1958},
publisher={North-Holland Publishing Company}
}
@article{milner_1978,
title = {A theory of type polymorphism in programming},
journal = {Journal of Computer and System Sciences},
volume = {17},
number = {3},
pages = {348-375},
year = {1978},
issn = {0022-0000},
doi = {https://doi.org/10.1016/0022-0000(78)90014-4},
url = {https://www.sciencedirect.com/science/article/pii/0022000078900144},
author = {Robin Milner},
}
@article{hindley_1969,
ISSN = {00029947},
URL = {http://www.jstor.org/stable/1995158},
author = {R. Hindley},
journal = {Transactions of the American Mathematical Society},
pages = {29--60},
publisher = {American Mathematical Society},
title = {The Principal Type-Scheme of an Object in Combinatory Logic},
volume = {146},
year = {1969}
}