Sequentiality in an Extensional Framework
暂无分享,去创建一个
[1] G.D. Plotkin,et al. LCF Considered as a Programming Language , 1977, Theor. Comput. Sci..
[2] Pierre-Louis Curien. Categorical Combinators, Sequential Algorithms, and Functional Programming , 1993, Progress in Theoretical Computer Science.
[3] Glynn Winskel,et al. An Introduction to Event Structures , 1989 .
[4] Robin Milner,et al. Fully Abstract Models of Typed lambda-Calculi , 1977, Theor. Comput. Sci..
[5] Antonio Bucciarelli,et al. Extensional Embedding of a Strongly Stable Model of PCF , 1991, ICALP.
[6] Antonio Bucciarelli,et al. Sequentiality and strong stability , 1991, [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science.
[7] Jean-Yves Girard,et al. The System F of Variable Types, Fifteen Years Later , 1986, Theor. Comput. Sci..
[8] Jean Vuillemin. Syntaxe, sémantique et axiomatique d'un langage de programmation simple , 1975 .
[9] Jean-Jacques Lévy,et al. Full abstraction for sequential languages : The states of the art , 1983 .
[10] Gérard Berry,et al. Stable Models of Typed lambda-Calculi , 1978, ICALP.
[11] Pierre-Louis Curien,et al. Sequential Algorithms on Concrete Data Structures , 1982, Theor. Comput. Sci..
[12] Albert R. Meyer,et al. Full Abstraction and the Context Lemma , 1991, TACS.