Online REPL and interactive tutorial for the Lambda Calculus
Welcome to Software Foundations in Coq
Control Operators, the SECD-Machine, and the Lambda-Calculus
Probabilistic compositional semantics, purely
We provide a general framework for the integration of formal semantics with probabilistic reasoning. This framework is conservative, in the sense that it relies only on typed λ-calculus and is thus co
Testing functional UIs - Hayleigh Thompson | Lambda Days 2025
OCaml Programming: Correct + Efficient + Beautiful — OCaml Programming: Correct + Efficient + Beautiful
A textbook on functional programming and data structures in OCaml, with an emphasis on semantics and software engineering. This book is the textbook for CS 3110 Data Structures and Functional Programming at Cornell University. A past title of this book was “Functional Programming in OCaml”.
Running inference in web extensions | The Mozilla Blog
Image generated by DALL*E We’re shipping a new API in Firefox Nightly that will let you use our Firefox AI runtime to run offline machine learning tasks
Brilliant | Your Personal Tutor for Math and Coding
Visual, interactive tutoring in math and coding, from 5th grade through college. Master concepts in algebra, calculus, Python, computer science, and more.
Algebra of programming
Algebra of programming by Bird, Richard, 1997, Prentice Hall edition, in English
Functional Query Languages with Categorical Types
We study three category-theoretic types in the context of functional query languages (typed lambda-calculi extended with additional operations for bulk data processing). The types we study are:
Call-by-name, call-by-value and the λ-calculus
This paper examines the old question of the relationship between ISWIM and the λ-calculus, using the distinction between call-by-value and call-by-name. It is held that the relationship should be mediated by a standardisation theorem. Since this leads to difficulties, a new λ-calculus is introduced whose standardisation theorem gives a good correspondence with ISWIM as given by the SECD machine, but without the letrec feature. Next a call-by-name variant of ISWIM is introduced which is in an analogous correspondence withthe usual λ-calculus. The relation between call-by-value and call-by-name is then studied by giving simulations of each language by the other and interpretations of each calculus in the other. These are obtained as another application of the continuation technique. Some emphasis is placed throughout on the notion of operational equality (or contextual equality). If terms can be proved equal in a calculus they are operationally equal in the corresponding language. Unfortunately, operational equality is not preserved by either of the simulations.
Karma3Labs/ts-eigencaster
Contribute to Karma3Labs/ts-eigencaster development by creating an account on GitHub.
The Blog of Maxime Heckel
Hi I'm Maxime, and this is my blog. In here, you'll find all the articles I wished I had when I was learning about web development, shaders, real-time 3D on the web, and more. Each piece I write aims to dive deep into the topics I'm passionate about, while also making complex topics more accessible through interactive playgrounds, visualization, and well detailed walkthroughs. My goal is to give you the tools and intuition to explore further on your own.
Programming Language Foundations in Agda – Table of Contents
This book is an introduction to programming language theory using the proof assistant Agda.