摘要: In order to define models of simply typed functional programming languages being closer the operational semantics these languages, notions sequentiality, stability and seriality were introduced. These works originated from definability problem for PCF, posed in [Sco72], full abstraction raised [Plo77].
springer.com
core.ac.uk
sci-hub.st 参考文章(17)
Guo-Qiang Zhang, Logic of Domains ,(1991)
Richard Alan Platek, Foundations of recursion theory University Microfilms. ,(1966)
R.O. Gandy, Computable Functionals of Finite Type I Studies in logic and the foundations of mathematics. ,vol. 46, pp. 202- 242 ,(1967) , 10.1016/S0049-237X(08)71509-X
V. Yu. Sazonov, Expressibility of functions in D. Scott's LCF language Algebra and Logic. ,vol. 15, pp. 192- 206 ,(1976) , 10.1007/BF01876321
G. Berry, P.L. Curien, Sequential algorithms on concrete data structures Theoretical Computer Science. ,vol. 20, pp. 265- 321 ,(1982) , 10.1016/S0304-3975(82)80002-9
S. C. Kleene, Recursive functionals and quantifiers of finite types revisited. V Transactions of the American Mathematical Society. ,vol. 325, pp. 593- 630 ,(1991) , 10.1090/S0002-9947-1991-0974519-8
G.D. Plotkin, LCF considered as a programming language Theoretical Computer Science. ,vol. 5, pp. 223- 255 ,(1977) , 10.1016/0304-3975(77)90044-5
Robert Cartwright, Matthias Felleisen, Observable sequentiality and full abstraction symposium on principles of programming languages. pp. 328- 342 ,(1992) , 10.1145/143165.143232
S. C. Kleene, Recursive functionals and quantifiers of finite types. II Transactions of the American Mathematical Society. ,vol. 108, pp. 106- 142 ,(1959) , 10.1090/S0002-9947-1959-0102480-9
Robin Milner, Fully abstract models of typed λ-calculi Theoretical Computer Science. ,vol. 4, pp. 1- 22 ,(1977) , 10.1016/0304-3975(77)90053-6