Related papers: Lecture notes on the lambda calculus
We describe a type system for the linear-algebraic lambda-calculus. The type system accounts for the part of the language emulating linear operators and vectors, i.e. it is able to statically describe the linear combinations of terms…
This is an updated version of the lectures notes for a course on condensed mathematics taught in the summer term 2019 at the University of Bonn. The material presented is joint work with Dustin Clausen. This is intended as a stable citable…
In this paper, we present an extension of $\lambda\mu$-calculus called $\lambda\mu^{++}$-calculus which has the following properties: subject reduction, strong normalization, unicity of the representation of data and thus confluence only on…
These notes are the second part of the tensor calculus documents which started with the previous set of introductory. In the present text, we continue the discussion of selected topics of the subject at a higher level expanding, when…
Emphasis is on 2d target space (c=1 coupled to gravity). Contents: 0. Introduction, Overview, and Purpose 1. Loops and States in Conformal Field Theory 2. 2D Euclidean Quantum Gravity I: Path Integral Approach 3. Brief Review of the…
This paper investigates type isomorphism in a lambda-calculus with intersection and union types. It is known that in lambda-calculus, the isomorphism between two types is realised by a pair of terms inverse one each other. Notably,…
In this short overview, we start with the basics of quantum computing, explaining the difference between the quantum and the classical control paradigms. We give an overview of the quantum control line of research within the lambda…
This chapter is based on lectures on Randomized Numerical Linear Algebra from the 2016 Park City Mathematics Institute summer school on The Mathematics of Data.
We study counting propositional logic as an extension of propositional logic with counting quantifiers. We prove that the complexity of the underlying decision problem perfectly matches the appropriate level of Wagner's counting hierarchy,…
We introduce and study graphic lambda calculus, a visual language which can be used for representing untyped lambda calculus, but it can also be used for computations in emergent algebras or for representing Reidemeister moves of locally…
We present several results on counting untyped lambda terms, i.e., on telling how many terms belong to such or such class, according to the size of the terms and/or to the number of free variables.
The lambda-PRK-calculus is a typed lambda-calculus that exploits the duality between the notions of proof and refutation to provide a computational interpretation for classical propositional logic. In this work, we extend lambda-PRK to…
This is the draft of lecture notes for Phd students in Sichuan University. In this notes we expand Li-Ruan's paper with much more detailed explanations and calculations.
This set of lecture notes constitutes the free textbook project I initiated towards the end of Summer 2015, while preparing for the Fall 2015 Analytical Methods in Physics course I taught to upper level undergraduates at the University of…
Lecture notes for the Yale Computer Science course CPSC 4690/5690 Randomized Algorithms. Suitable for use as a supplementary text for an introductory graduate or advanced undergraduate course on randomized algorithms. Discusses tools from…
We define two extensions of the typed linear lambda-calculus that yield minimal Turing-complete systems. The extensions are based on unbounded recursion in one case, and bounded recursion with minimisation in the other. We show that both…
We give a brief introduction to the clocked lambda calculus, an extension of the classical lambda calculus with a unary symbol tau used to witness the beta-steps. In contrast to the classical lambda calculus, this extension is infinitary…
These are lecture notes for a mini-course given at the Cornell Probability Summer School in July 2013. Topics include lozenge tilings of polygons and their representation theoretic interpretation, the (q,t)-deformation of those leading to…
These are lecture notes of a course on Calogero-Moser systems and their connections with representation theory and geometry, given by the author in Zurich in May-June 2005.
System I is a simply-typed lambda calculus with pairs, extended with an equational theory obtained from considering the type isomorphisms as equalities. In this work we propose an extension of System I to polymorphic types, adding the…