论文信息 - Stochastic λ-calculi: An extended abstract

Stochastic λ-calculi: An extended abstract

It is shown how the operators in the ''graph model'' for @l-calculus (which can function as a programming language for Recursive Function Theory) can be expanded to allow for ''random combinators''. The result then is a model for a new language for random algorithms.

Dana S. Scott

[1] Klaus Keimel,et al. Continuous Lattices and Domains: Preface , 2003 .

[2] Dana S. Scott,et al. Data Types as Lattices , 1976, SIAM J. Comput..

[3] Gordon D. Plotkin,et al. Set-Theoretical and Other Elementary Models of the lambda-Calculus , 1993, Theor. Comput. Sci..

[4] J. C. E. Dekker. Review: J. Myhill, J. C. Shepherdson, Effective Operations on Partial Recursive Functions , 1957 .

[5] J. Roger Hindley,et al. Lambda-Calculus and Combinators in the 20th Century , 2009, Logic from Russell to Church.

[6] Jr. Hartley Rogers. Theory of Recursive Functions and Effective Computability , 1969 .

[7] Ugo Dal Lago,et al. Probabilistic operational semantics for the lambda calculus , 2011, RAIRO Theor. Informatics Appl..

[8] H. Rogers,et al. Reducibility and Completeness for Sets of Integers , 1959 .

[9] D. C. Cooper,et al. Theory of Recursive Functions and Effective Computability , 1969, The Mathematical Gazette.

[10] Ugo de'Liguoro,et al. Non Deterministic Extensions of Untyped Lambda-Calculus , 1995, Inf. Comput..

[11] John C. Shepherdson,et al. Effective operations on partial recursive functions , 1955 .

[12] G. Plotkin. Set-theoretical and Other Elementary Models of the -calculus Part 1: a Set-theoretical Deenition of Applica- Tion 1 Introduction , 2007 .

[13] K. Hofmann,et al. Continuous Lattices and Domains , 2003 .