Livestream available here
Abstract
It is shown how the operators in the “graph model” for λ-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 semantics for a new language for random algorithms. The author wants to make a plea for finding applications.
Related Talks
Also on Thursday, Dana Scott will give a lecture at the BCS, from 18:00, on Lambda Calculus: Then & Now.
Abstract: A very fast development in the early 1930’s following Hilbert’s codification of Mathematical Logic led to the Incompleteness Theorems, Computable Functions, Undecidability Theorems, and the general formulation of Recursive Function Theory. The so-called Lambda Calculus played a key role. The history of these developments will be traced, and the much later place of Lambda Calculus in Mathematics and Programming-Language Theory will be outlined.
This lecture is free to attend but you will need to register. For details and to register please see: http://www.bcs.org/category/18788
The talk and lecture are part of a series of talks by Dana Scott in London in May and June, as below:
Types and Type-free Lambda Calculus
Friday 27th May, 11am, Room 405 (4th floor), UCL, 66-72 Gower Street, WC1E 6EA
Abstract: Denotational semantics started in Oxford in late 1969. It was hoped that domain theory would provide a basis both for recursive definitions in programs and recursive definitions of semantical structures. Early troubles were encountered in using tops and bottoms, and soon researchers turned to operational semantics. Others wanted to expand work to communicating and parallel processes. Axiomatic and synthetic theories did not solve the problems, and as a result much research effort in domain theory faded. Late work by Reynolds and collaborators, however, has opened up new and promising approaches for programming-language semantics. Perhaps the much simplified modeling using enumeration operators can spark some new investigations, especially since it is so easy to add a rich type structure to the calculus.
Why Mathematical Proofs? Joint Maths Colloquium/EECS Distinguished seminar by Prof. Dana Scott
Wednesday 1 June, 15:00 – 16:00, Maths Lecture Theatre, Queen Mary University. Followed by a wine reception from 18:00 (Lobby area of Maths department)
Some of the talks and lectures will be streamed. If you are outside London and are interested in these talks, please contact Teresa Carbajo Garcia.