Difference between revisions of "Lambda Calculus"

From PKC
Jump to navigation Jump to search
Line 1: Line 1:
Lambda calculus is a universal/Turing-complete language specification invented by Alonzo Church, that is considered to be mathematically elegant, due to its small size. Almost all text-based formal languages are defined using Lambda calculus. To learn about its history, it is recommended to watch this video by [[Dana Scott]]<ref>{{:Video/Dana S. Scott Lambda Calculus, Then and Now}}</ref>.
Lambda calculus is a universal/Turing-complete language specification invented by [[Alonzo Church]], that is considered to be mathematically elegant, due to its small size. Almost all text-based formal languages are defined using Lambda calculus. To learn about its history, it is recommended to watch this video by [[Dana Scott]]<ref>{{:Video/Dana S. Scott Lambda Calculus, Then and Now}}</ref>.


=[[Lambda Calculus]] and [[Abstract Syntax Tree]]=
=[[Lambda Calculus]] and [[Abstract Syntax Tree]]=

Revision as of 04:41, 5 February 2022

Lambda calculus is a universal/Turing-complete language specification invented by Alonzo Church, that is considered to be mathematically elegant, due to its small size. Almost all text-based formal languages are defined using Lambda calculus. To learn about its history, it is recommended to watch this video by Dana Scott[1].

Lambda Calculus and Abstract Syntax Tree

All decision making procedures can be represented into three major kinds of branching:

  1. Naming Abstraction: conversion
  2. Branching Abstraction: conversion
  3. Typing Abstraction: conversion

These three types also relate to the reason why Kan Extension is universal.

Video Playlist

  • For people who wants to learn about Lambda Calculus, this video playlist[2] would be very useful.


References

Related Pages