Lecture 13: Natural Language Semantics I
|
|
- Luke Tate
- 5 years ago
- Views:
Transcription
1 Comp24412 Symbolic AI Lecture 13: Natural Language Semantics I Ian Pratt-Hartmann Room KB ipratt@cs.man.ac.uk
2 Outline A notation for functions Natural language semantics Prolog implementation
3 Some functions defined on the integers: λx[2x] = { 0,0, 1,2, 2,4,...} λx[x 2 ] = { 0,0, 1,1, 2,4, 3,9,...} λx[(x +4) 3 ] = { 0,64, 1,125, 2,216,...}
4 Some more functions λx[x] = λx[x +0] = { 0,0, 1,1, 2,2,...} λx[x +1] = { 0,1, 1,2, 2,3,...} λx[x +2] = { 0,2, 1,3, 2,4,...} Functions with functions as values λy[λx[x +y]] = { 0,{ 0,0, 1,1,...}, 1,{ 0,1, 1,2,...}, 2,{ 0,2, 1,3,...},...}
5 Applying functions: (λx[2x] 3) = 2.3 = 6 (λx[x 2 ] 5) = 5 2 = 25 (λx[(x +4) 3 ] 2) = (2+4) 3 = 216 (λy[λx[x +y]] 2) = λx[x +2] ((λy[λx[x +y]] 2) 3) = (λx[x +2] 3) = 2+3 = 5
6 Note: some authors (actually, just Blackburn and Bos) use notation, thus: (λx[2x])@3 = 2.3 = 6 (λx[x 2 ])@5 = 5 2 = 25 (λy[λx[x +y]])@2)@3 = λx[x +2]@3 = 2+3 = 5
7 Higher-order functions take functions as arguments. Here is a function which takes function on numbers, and applies it to 5: λf[(f 5)] Then we can compute (λf[(f 5)] λx[x +1]) = (λx[x +1] 5) = 5+1 = 6. Notice that this procedure is completely mechanical.
8 Functions with other domains and ranges λx[(prime x)] = { 0,F, 1,F, 2,T, 3,T, 4,F,...} Let {john,mary,...,jane} be a set of individuals λx[(boy x)] = { john,t, mary,f,..., jane,f } and of course λx[λy[((kissed x) y))]] = { john,{ john,f, mary,t,..., jane,f }, mary,{ john,t, mary,f,..., jane,f },... jane,{ john,f, mary,f,..., jane,f } }
9 Again, we can have higher-order functions over such domains. the property of being a property possessed by Mary: λp[(p mary)] the property of being a property possessed by every girl: λp[ x((girl x) (p x))] the property of being a property possessed by some boy: λp[ x((boy x) (p x))]
10 The lambda calculus features two operations on lambda-expressions: α-conversion: renaming of bound variables: λx[ϕ(x)] = λy[ϕ(y)] where y is a variable not occurring free in ϕ β-reduction: applying lambda functions to their arguments: (λx[ϕ(x)] ψ) = ϕ(ψ) where ψ is an expression of the appropriate type. Here, the expression on the left-hand-side is called the redex and the expression on the right, the reduct.
11 Outline A notation for functions Natural language semantics Prolog implementation
12 Consider the (old-style) grammar rules: S NP,VP NP PropN VP Vi and lexicon PropN Mary Vi coughed
13 This grammar assigns the sentence Mary coughed the structure: S NP PropN VP Vi Mary coughed
14 Let us now assign meanings as follows: [[ NP Mary]] = λp[(p mary)] [[ Vi coughed]] = λx[(coughed x)] And let us augment the grammar rules with semantic information: S/(ϕ ψ) NP/ϕ,VP/ψ VP/ϕ Vi/ϕ
15 These meaning-assignments and grammar rule tell us that [[ S Mary coughed]] = ([[ NP Mary]] [[ VP coughed]]) = (λp[p(mary)] λx[(coughed x)]) = (coughed mary)
16 We can illustrate this process diagrammatically: S coughed(mary) NP VP λp[p(mary)] λx[coughed(x)] Mary V λx[coughed(x)] coughed
17 Similarly, consider the sentence Mary kissed John, with structure S NP VP PropN Mary V kissed NP PropN John
18 Let us assign meanings as follows: [[ NP John]] = λp[(p john)] [[ NP Mary]] = λp[(p mary)] [[ V kissed]] = λs[λx[s(λy[((kissedx)y))])]] And let us augment the usual VP rule with semantic information: VP/(ϕ ψ) V/ϕ,NP/ψ
19 This leads to the following meaning computation: S kissed(mary,john) = λp[p(mary)](λx[kissed(x, john)]) NP λp[p(mary)] VP λx[kissed(x, john)] Mary V λs[λx[s(λy[kissed(x, y)] NP λp[p(john)] kissed John
20 Outline A notation for functions Natural language semantics Prolog implementation
21 Lambda-expressions can easily be encoded in Prolog Lambda-calculus: λx[(boy x)] Prolog: lbd(x, boy(x)) Lambda-calculus: λp[λq[ x((p x) (q x))]] Prolog: lbd(p,lbd(q,forall(x,px -> qx)))
22 I have written a predicate var replace/2 that performs α-conversion: λx[(f (g ((h x) x)))] = λx [(f (g ((h x ) x )))]?- var_replace(lbd(x,f(g(h(x,x)))),l). L = lbd(x2, f(g(h(x2, x2)))) ; No λp[λq[ x((p x) (q x))]] = λp [λq [ x ((p x ) (q x ))]] var_replace(lbd(p, lbd(q, exists(x, (p@x & q@x)))),l). L = lbd(p1, lbd(q1, exists(x1, p1@x1&q1@x1))) ; No
23 var_replace(x,x):- atomic(x),!. var_replace(x,result):- X =.. [Head,Var,Expr], variable_binder(head),!, gensym(var,result_var), substitute(var,result_var,expr,result_expr1), var_replace(result_expr1,result_expr), Result =.. [Head,Result_var,Result_expr]. var_replace(x,result):- X =.. XList, maplist(var_replace,xlist,resultlist), Result =.. ResultList. variable_binder(lbd). variable_binder(forall). variable_binder(exists).
24 We define the substitution predicate as: % Expression B is the result of substituting % an occurrence of expression Y for each % occurrence of expression X in expression A. substitute(x,y,x,y):-!. substitute(_x,_y,a,a):- atomic(a),!. substitute(x,y,a,b):- A =.. A_list, maplist(substitute(x,y),a_list,b_list), B =.. B_list.
25 Similarly, I have written a predicate beta/2 that implements β-reduction assuming that there are no variable clashes: ( λq[ λp[ x(q(x) p(x))]] λx 1 [boy(x 1 )]) = λp[ x(boy(x) p(x beta(lbd(q, lbd(p, forall(x, (q@x -> p@x))))@(lbd(x1,boy@x1)),l). L = lbd(p, forall(x, boy@x->p@x)); No
26 Now beta is implemented as follows: beta(exp,exp):- atomic(exp),!. substitute(v,exp,f_body,result1), beta(result1,result). beta(exp,result):- Exp=..ExpList, maplist(beta,explist,resultlist), Result=..ResultList. To think about: does the order in which the redexes are reduced matter? To think about: does the process even terminate?
27 Now for the clever bit We can transcribe the augmented grammar rules S/ϕ(ψ) NP/ϕ, VP/ψ VP/ϕ(ψ) V/ϕ, NP/ψ as the Prolog DCG rules s(ssem) --> np(npsem), vp(vpsem), {var_replace(npsem,npsem1), vp(vpsem) --> v(vsem), np(npsem), {var_replace(vsem,vsem1),
28 And we can encode the meaning-assignments [[ NP John]] = λp[(p john)] [[ NP Mary]] = λp[(p mary)] [[ V kissed]] = λs[λx[s(λy[((kissed x) y)])]] as the the Prolog DCG rules np(lbd(p,p@john)) --> [john]. np(lbd(p,p@mary)) --> [mary]. v(lbd(s,lbd(x,s@lbd(y,kissed(x,y))))) --> [kissed].
29 The result is:?- s(ssem,[john,kissed,mary],[]). SSem = kissed(john, mary) ; Prolog has performed the calculation carried out above
30 Consider the sentence Every boy loves some girl. We assign meanings as follows: [[ Det every]] = λqλp[ x((q x) (p x)] [[ Det some]] = λqλp[ x((q x) (p x)] [[ V loves]] = λs[λx[(s λy[((loves x) y)])]] [[ N boy]] = λx[(boy x)] [[ N girl]] = λx[(girl x)] And we augment the usual NP rule with semantic information: NP/(ϕ ψ) Det/ϕ,N/ψ
31 We encode all of this as Prolog DCG rules in the usual way: np(npsem) --> det(detsem), n(nsem), {var_replace(detsem,detsem1), & --> [some]. -> --> [every]. (loves(x,y)))))) --> [loves]. n(lbd(x,boy(x)))--> [boy]. n(lbd(x,girl(x)))--> [girl].
32 Lo and behold:?- s(ssem,[every,boy,loves,some,girl],[]), pp(ssem). (x11)(boy(x11) => (Ex2)(girl(x2) & loves(x11, x2))) which, when we change the fonts a bit, becomes x 11 (boy(x 11 ) x 2 (girl(x 2 ) loves(x 11,x 2 )))
33 Similarly:?- s(ssem,[some,girl,loves,some,girl],[]), pp(ssem). (Ex41)(girl(x41) & (Ex5)(girl(x5) & loves(x41, x5))) which, when we change the fonts a bit, becomes Wow! x 41 (girl(x 41 ) x 5 (girl(x 5 ) loves(x 41,x 5 )))
34 Summary: The Lambda calculus: α-conversion β-reduction Semantics: Meaning assignment to terminals Semantically augmented grammar Computation of sentence meaning Transcription into Prolog Illustrations
A Brief Incomplete Introduction to NLTK
A Brief Incomplete Introduction to NLTK This introduction ignores and simplifies many aspects of the Natural Language TookKit, focusing on implementing and using simple context-free grammars and lexicons.
More informationFundamentals and lambda calculus
Fundamentals and lambda calculus Again: JavaScript functions JavaScript functions are first-class Syntax is a bit ugly/terse when you want to use functions as values; recall block scoping: (function ()
More informationLING 130: Quantified Noun Phrases
LING 130: Quantified Noun Phrases James Pustejovsky March 15, 2010 1 Syntax for Typed λ-calculus We will now present a language which uses specific types of entities, where the entities are combined with
More informationLexicografie computationala Feb., 2012
Lexicografie computationala Feb., 2012 Anca Dinu University of Bucharest Introduction When we construct meaning representations systematically, we integrate information from two different sources: 1. The
More informationFundamentals and lambda calculus. Deian Stefan (adopted from my & Edward Yang s CSE242 slides)
Fundamentals and lambda calculus Deian Stefan (adopted from my & Edward Yang s CSE242 slides) Logistics Assignments: Programming assignment 1 is out Homework 1 will be released tomorrow night Podcasting:
More informationActivity. CSCI 334: Principles of Programming Languages. Lecture 4: Fundamentals II. What is computable? What is computable?
Activity CSCI 334: Principles of Programming Languages Lecture 4: Fundamentals II Write a function firsts that, when given a list of cons cells, returns a list of the left element of each cons. ( (a. b)
More informationλ -Calculus in Prolog
λ -Calculus in Prolog Chapter 2.4 of Representation and Inference for Natural Language C. Millar Seminar fr Sprachwissenschaft Computational Semantics SS/2008 Outline 1 β -conversion á la Proglog Outline
More informationLast class. CS Principles of Programming Languages. Introduction. Outline
Last class CS6848 - Principles of Programming Languages Principles of Programming Languages V. Krishna Nandivada IIT Madras Interpreters A Environment B Cells C Closures D Recursive environments E Interpreting
More informationSemantics 1. Gerhard Jäger. April 26, (April 26, 2012) Semantics 1 Gerhard Jäger 1 / 28
Semantics 1 April 26, 2012 Gerhard Jäger (April 26, 2012) Semantics 1 Gerhard Jäger 1 / 28 Sentence semantics Explanatory goal truth conditions of declarative sentences meaning relations between declarative
More information5. Introduction to the Lambda Calculus. Oscar Nierstrasz
5. Introduction to the Lambda Calculus Oscar Nierstrasz Roadmap > What is Computability? Church s Thesis > Lambda Calculus operational semantics > The Church-Rosser Property > Modelling basic programming
More informationProgramming Language Features. CMSC 330: Organization of Programming Languages. Turing Completeness. Turing Machine.
CMSC 330: Organization of Programming Languages Lambda Calculus Programming Language Features Many features exist simply for convenience Multi-argument functions foo ( a, b, c ) Ø Use currying or tuples
More informationCMSC 330: Organization of Programming Languages
CMSC 330: Organization of Programming Languages Lambda Calculus CMSC 330 1 Programming Language Features Many features exist simply for convenience Multi-argument functions foo ( a, b, c ) Ø Use currying
More informationFormal Semantics. Aspects to formalize. Lambda calculus. Approach
Formal Semantics Aspects to formalize Why formalize? some language features are tricky, e.g. generalizable type variables, nested functions some features have subtle interactions, e.g. polymorphism and
More informationDiscourse Representation Theory Building Discourse Representations
and and Lehrstuhl für Künstliche Intelligenz Institut für Informatik Friedrich-Alexander-Universität Erlangen-Nürnberg 13. Januar 2006 1 1 Slides are mainly due to Johan Bos lecture on Semantics (GSLT)
More informationLambda Calculus. CS 550 Programming Languages Jeremy Johnson
Lambda Calculus CS 550 Programming Languages Jeremy Johnson 1 Lambda Calculus The semantics of a pure functional programming language can be mathematically described by a substitution process that mimics
More informationLambda Calculus. Lecture 4 CS /26/10
Lambda Calculus Lecture 4 CS 565 10/26/10 Pure (Untyped) Lambda Calculus The only value is a function Variables denote functions Functions always take functions as arguments Functions always return functions
More informationPure Lambda Calculus. Lecture 17
Pure Lambda Calculus Lecture 17 Lambda Calculus Lambda Calculus (λ-calculus) is a functional notation introduced by Alonzo Church in the early 1930s to formalize the notion of computability. Pure λ-calculus
More informationλ calculus Function application Untyped λ-calculus - Basic Idea Terms, Variables, Syntax β reduction Advanced Formal Methods
Course 2D1453, 2006-07 Advanced Formal Methods Lecture 2: Lambda calculus Mads Dam KTH/CSC Some material from B. Pierce: TAPL + some from G. Klein, NICTA Alonzo Church, 1903-1995 Church-Turing thesis First
More informationLambda Calculus. Variables and Functions. cs3723 1
Lambda Calculus Variables and Functions cs3723 1 Lambda Calculus Mathematical system for functions Computation with functions Captures essence of variable binding Function parameters and substitution Can
More informationIntroduction to Lambda Calculus. Lecture 5 CS 565 1/24/08
Introduction to Lambda Calculus Lecture 5 CS 565 1/24/08 Lambda Calculus So far, we ve explored some simple but non-interesting languages language of arithmetic expressions IMP (arithmetic + while loops)
More informationCMSC 330: Organization of Programming Languages
CMSC 330: Organization of Programming Languages Lambda Calculus CMSC 330 1 Programming Language Features Many features exist simply for convenience Multi-argument functions foo ( a, b, c ) Use currying
More informationConcepts of programming languages
Concepts of programming languages Lecture 5 Wouter Swierstra 1 Announcements Submit your project proposal to me by email on Friday; The presentation schedule in now online Exercise session after the lecture.
More information11/6/17. Outline. FP Foundations, Scheme. Imperative Languages. Functional Programming. Mathematical Foundations. Mathematical Foundations
Outline FP Foundations, Scheme In Text: Chapter 15 Mathematical foundations Functional programming λ-calculus LISP Scheme 2 Imperative Languages We have been discussing imperative languages C/C++, Java,
More informationCOMP 1130 Lambda Calculus. based on slides by Jeff Foster, U Maryland
COMP 1130 Lambda Calculus based on slides by Jeff Foster, U Maryland Motivation Commonly-used programming languages are large and complex ANSI C99 standard: 538 pages ANSI C++ standard: 714 pages Java
More informationImplementing functional languages with abstract machines
Implementing functional languages with abstract machines Hayo Thielecke University of Birmingham http://www.cs.bham.ac.uk/~hxt December 9, 2015 Contents Introduction Lambda calculus and programming languages
More informationdynamically typed dynamically scoped
Reference Dynamically Typed Programming Languages Part 1: The Untyped λ-calculus Jim Royer CIS 352 April 19, 2018 Practical Foundations for Programming Languages, 2/e, Part VI: Dynamic Types, by Robert
More informationLambda Calculus and Type Inference
Lambda Calculus and Type Inference Björn Lisper Dept. of Computer Science and Engineering Mälardalen University bjorn.lisper@mdh.se http://www.idt.mdh.se/ blr/ August 17, 2007 Lambda Calculus and Type
More informationIntroduction to Lambda Calculus. Lecture 7 CS /08/09
Introduction to Lambda Calculus Lecture 7 CS 565 02/08/09 Lambda Calculus So far, we ve explored some simple but non-interesting languages language of arithmetic expressions IMP (arithmetic + while loops)
More informationChapter 5: The Untyped Lambda Calculus
Chapter 5: The Untyped Lambda Calculus What is lambda calculus for? Basics: syntax and operational semantics Programming in the Lambda Calculus Formalities (formal definitions) What is Lambda calculus
More informationLambda Calculus and Extensions as Foundation of Functional Programming
Lambda Calculus and Extensions as Foundation of Functional Programming David Sabel and Manfred Schmidt-Schauß 29. September 2015 Lehrerbildungsforum Informatik Last update: 30. September 2015 Overview
More informationGrammar Rules in Prolog
Grammar Rules in Prolog Based on Clocksin & Mellish Chapter 9 GR-1 Backus-Naur Form (BNF) BNF is a common grammar used to define programming languages» Developed in the late 1950's early 60's Grammars
More informationHarvard School of Engineering and Applied Sciences Computer Science 152
Harvard School of Engineering and Applied Sciences Computer Science 152 Lecture 17 Tuesday, March 30, 2010 1 Polymorph means many forms. Polymorphism is the ability of code to be used on values of different
More informationComputational Linguistics: Syntax-Semantics
Computational Linguistics: Syntax-Semantics Raffaella Bernardi University of Trento Contents 1 The Three Tasks Revised................................... 3 2 Lambda terms and CFG...................................
More informationLecture 5: The Untyped λ-calculus
Lecture 5: The Untyped λ-calculus Syntax and basic examples Polyvios Pratikakis Computer Science Department, University of Crete Type Systems and Static Analysis Pratikakis (CSD) Untyped λ-calculus I CS49040,
More informationLogical Semantics. Chapter Introduction
Chapter 12 Logical Semantics 12.1 Introduction There are many NLP applications where it would be useful to have some representation of the meaning of a natural language sentence. For instance, as we pointed
More informationOne of a number of approaches to a mathematical challenge at the time (1930): Constructibility
λ Calculus Church s λ Calculus: Brief History One of a number of approaches to a mathematical challenge at the time (1930): Constructibility (What does it mean for an object, e.g. a natural number, to
More informationPure (Untyped) λ-calculus. Andrey Kruglyak, 2010
Pure (Untyped) λ-calculus Andrey Kruglyak, 2010 1 Pure (untyped) λ-calculus An example of a simple formal language Invented by Alonzo Church (1936) Used as a core language (a calculus capturing the essential
More informationThe quantifier store will be used for creating scope ambiguities. We will assume that for lexical entries the quantifier store is empty.
CHAPTER SEVEN: QUANTIFYING-IN AND STORAGE 7.1 Scope ambiguities, quantifying-in and storage. We will now add a mechanism for creating scope ambiguities. Following Cooper 1975, 1983, the mechanism we will
More informationLogic and Natural Language Semantics: Formal Semantics
Logic and Natural Language Semantics: Formal Semantics Raffaella Bernardi DISI, University of Trento e-mail: bernardi@disi.unitn.it Contents 1 Logic....................................................
More informationLING 364: Introduction to Formal Semantics. Lecture 7 February 2nd
LING 364: Introduction to Formal Semantics Lecture 7 February 2nd Administrivia today (3:30pm 4:40pm) lecture here in Comm 214 (4:45pm 5:45pm) (EXTRA) lab practice in Social Sciences Lab 224 also next
More informationHarvard School of Engineering and Applied Sciences CS 152: Programming Languages. Lambda calculus
Harvard School of Engineering and Applied Sciences CS 152: Programming Languages Tuesday, February 19, 2013 The lambda calculus (or λ-calculus) was introduced by Alonzo Church and Stephen Cole Kleene in
More informationCSCI.4430/6969 Programming Languages Lecture Notes
CSCI.4430/6969 Programming Languages Lecture Notes August 28, 2006 1 Brief History of Programming Languages Ada Augusta, the Countess of Lovelace, the daughter of the poet Lord Byron, is attributed as
More informationLecture 7. Introduction to Function-Argument Structure and Lambdas. 1. Function-argument structure in natural language
B. Partee, March 15, 2006 p.1 Lecture 7. Introduction to Function-Argument Structure and Lambdas 1. Function-argument structure in natural language...1 1.1. Function-argument application as basic semantic
More informationCITS3211 FUNCTIONAL PROGRAMMING
CITS3211 FUNCTIONAL PROGRAMMING 9. The λ calculus Summary: This lecture introduces the λ calculus. The λ calculus is the theoretical model underlying the semantics and implementation of functional programming
More informationLambda Calculus. Adrian Groza. Department of Computer Science Technical University of Cluj-Napoca
Lambda Calculus Adrian Groza Department of Computer Science Technical University of Cluj-Napoca Outline 1 λ-calculus 2 Operational Semantics Syntax Conversions Normal Form 3 Lambda Calculus as a Functional
More informationThe Untyped Lambda Calculus
Resources: The slides of this lecture were derived from x = 1 [Järvi], with permission of the original author, by copy & let x = 1 in... paste or by selection, annotation, or rewording. [Järvi] is in turn
More informationOverview. CS389L: Automated Logical Reasoning. Lecture 6: First Order Logic Syntax and Semantics. Constants in First-Order Logic.
Overview CS389L: Automated Logical Reasoning Lecture 6: First Order Logic Syntax and Semantics Işıl Dillig So far: Automated reasoning in propositional logic. Propositional logic is simple and easy to
More informationGrammar Rules in Prolog!!
Grammar Rules in Prolog GR-1 Backus-Naur Form (BNF) BNF is a common grammar used to define programming languages» Developed in the late 1950 s Because grammars are used to describe a language they are
More informationLambda Calculus. Type Systems, Lectures 3. Jevgeni Kabanov Tartu,
Lambda Calculus Type Systems, Lectures 3 Jevgeni Kabanov Tartu, 13.02.2006 PREVIOUSLY ON TYPE SYSTEMS Arithmetical expressions and Booleans Evaluation semantics Normal forms & Values Getting stuck Safety
More informationType Systems Winter Semester 2006
Type Systems Winter Semester 2006 Week 4 November 8 November 15, 2006 - version 1.1 The Lambda Calculus The lambda-calculus If our previous language of arithmetic expressions was the simplest nontrivial
More informationThe Untyped Lambda Calculus
Resources: The slides of this lecture were derived from [Järvi], with permission of the original author, by copy & x = 1 let x = 1 in... paste or by selection, annotation, or rewording. [Järvi] is in turn
More information> module Lambda where > import Data.List -- I need some standard list functions
Lecture 9 Lambda Calculus We now look at lambda calculus, the theoretical stuff that underlies functional programming. It was introduced by Alonzo Church to formalise two key concepts when dealing with
More informationThe Untyped Lambda Calculus
Resources: The slides of this lecture were derived from [Järvi], with permission of the original author, by copy & x = 1 let x = 1 in... paste or by selection, annotation, or rewording. [Järvi] is in turn
More informationSemantics and Pragmatics of NLP Propositional Logic, Predicates and Functions
, Semantics and Pragmatics of NLP, and s Alex Ewan School of Informatics University of Edinburgh 10 January 2008 , 1 2 3 4 Why Bother?, Aim: 1 To associate NL expressions with semantic representations;
More informationMore Theories, Formal semantics
Parts are based on slides by Carl Pollard Charles University, 2011-11-12 Optimality Theory Universal set of violable constraints: Faithfulness constraints:surface forms should be as close as to underlying
More informationLecture 4: Linear Programming
COMP36111: Advanced Algorithms I Lecture 4: Linear Programming Ian Pratt-Hartmann Room KB2.38: email: ipratt@cs.man.ac.uk 2017 18 Outline The Linear Programming Problem Geometrical analysis The Simplex
More informationCMSC 336: Type Systems for Programming Languages Lecture 5: Simply Typed Lambda Calculus Acar & Ahmed January 24, 2008
CMSC 336: Type Systems for Programming Languages Lecture 5: Simply Typed Lambda Calculus Acar & Ahmed January 24, 2008 Contents 1 Solution to the Exercise 1 1.1 Semantics for lambda calculus.......................
More informationRecursive Definitions, Fixed Points and the Combinator
Recursive Definitions, Fixed Points and the Combinator Dr. Greg Lavender Department of Computer Sciences University of Texas at Austin Recursive Self-Reference Recursive self-reference occurs regularly
More informationComputational Linguistics: Syntax-Semantics Interface
Computational Linguistics: Syntax-Semantics Interface Raffaella Bernardi KRDB, Free University of Bozen-Bolzano P.zza Domenicani, Room: 2.28, e-mail: bernardi@inf.unibz.it Contents 1 Lambda terms and DCG...................................
More informationChapter 5: The Untyped Lambda Calculus
Chapter 5: The Untyped Lambda Calculus What is lambda calculus for? Basics: syntax and operational semantics Programming in the Lambda Calculus Formalities (formal definitions) What is Lambda calculus
More informationSeach algorithms The travelling salesman problem The Towers of Hanoi Playing games. Comp24412: Symbolic AI. Lecture 4: Search. Ian Pratt-Hartmann
Comp24412: Symbolic AI Lecture 4: Search Ian Pratt-Hartmann Room KB2.38: email: ipratt@cs.man.ac.uk 2016 17 Outline Seach algorithms The travelling salesman problem The Towers of Hanoi Playing games Typical
More informationLambda Calculus alpha-renaming, beta reduction, applicative and normal evaluation orders, Church-Rosser theorem, combinators
Lambda Calculus alpha-renaming, beta reduction, applicative and normal evaluation orders, Church-Rosser theorem, combinators Carlos Varela Rennselaer Polytechnic Institute February 11, 2010 C. Varela 1
More informationResources: The slides of this lecture were derived from [Järvi], with permission of the original author, by copy & x = 1 let x = 1 in...
Resources: The slides of this lecture were derived from [Järvi], with permission of the original author, by copy & x = 1 let x = 1 in... paste or by selection, annotation, or rewording. [Järvi] is in turn
More informationFoundations of AI. 9. Predicate Logic. Syntax and Semantics, Normal Forms, Herbrand Expansion, Resolution
Foundations of AI 9. Predicate Logic Syntax and Semantics, Normal Forms, Herbrand Expansion, Resolution Wolfram Burgard, Andreas Karwath, Bernhard Nebel, and Martin Riedmiller 09/1 Contents Motivation
More informationCMPUT 325 : Lambda Calculus Basics. Lambda Calculus. Dr. B. Price and Dr. R. Greiner. 13th October 2004
CMPUT 325 : Lambda Calculus Basics Dr. B. Price and Dr. R. Greiner 13th October 2004 Dr. B. Price and Dr. R. Greiner CMPUT 325 : Lambda Calculus Basics 1 Lambda Calculus Lambda calculus serves as a formal
More informationλ-calculus Lecture 1 Venanzio Capretta MGS Nottingham
λ-calculus Lecture 1 Venanzio Capretta MGS 2018 - Nottingham Table of contents 1. History of λ-calculus 2. Definition of λ-calculus 3. Data Structures 1 History of λ-calculus Hilbert s Program David Hilbert
More informationThe University of Nottingham SCHOOL OF COMPUTER SCIENCE A LEVEL 4 MODULE, SPRING SEMESTER MATHEMATICAL FOUNDATIONS OF PROGRAMMING ANSWERS
The University of Nottingham SCHOOL OF COMPUTER SCIENCE A LEVEL 4 MODULE, SPRING SEMESTER 2012 2013 MATHEMATICAL FOUNDATIONS OF PROGRAMMING ANSWERS Time allowed TWO hours Candidates may complete the front
More information6.863J Natural Language Processing Lecture 16: The meaning of it all, #2. (or #42) Instructor: Robert C. Berwick
6.863J Natural Language Processing Lecture 16: The meaning of it all, #2 (or #42) Instructor: Robert C. Berwick berwick@ai.mit.edu The Menu Bar Administrivia: Lab 4a out April 14 Agenda: What does this
More informationCMSC 330: Organization of Programming Languages. Lambda Calculus Encodings
CMSC 330: Organization of Programming Languages Lambda Calculus Encodings CMSC330 Spring 2018 1 The Power of Lambdas Despite its simplicity, the lambda calculus is quite expressive: it is Turing complete!
More informationDefinite-clause grammars: PSGs in Prolog (in principle, string rewrite described as a logical formula).
Computational Encoding of PSGs Logical (declarative) Network-based (procedural) Definite-clause grammars: PSGs in Prolog (in principle, string rewrite described as a logical formula). For a grammar G =
More informationSyntax-semantics interface and the non-trivial computation of meaning
1 Syntax-semantics interface and the non-trivial computation of meaning APA/ASL Group Meeting GVI-2: Lambda Calculi, Type Systems, and Applications to Natural Language APA Eastern Division 108th Annual
More informationLecture 9. Fragment 3 of English including Possessives, using Lambdas.
Lecture 9. Fragment 3 of English including Possessives, using Lambdas. 1. Using lambdas to express semantics of Genitives, relational nouns, relational adjectives....1 1.1. Genitives and noun meanings....1
More informationA Quick Overview. CAS 701 Class Presentation 18 November Department of Computing & Software McMaster University. Church s Lambda Calculus
A Quick Overview CAS 701 Class Presentation 18 November 2008 Lambda Department of Computing & Software McMaster University 1.1 Outline 1 2 3 Lambda 4 5 6 7 Type Problem Lambda 1.2 Lambda calculus is a
More information9/23/2014. Why study? Lambda calculus. Church Rosser theorem Completeness of Lambda Calculus: Turing Complete
Dr A Sahu Dept of Computer Science & Engineering IIT Guwahati Why study? Lambda calculus Syntax Evaluation Relationship to programming languages Church Rosser theorem Completeness of Lambda Calculus: Turing
More informationCMSC 330: Organization of Programming Languages
CMSC 330: Organization of Programming Languages Lambda Calculus Encodings CMSC 330 Summer 2017 1 The Power of Lambdas Despite its simplicity, the lambda calculus is quite expressive: it is Turing complete!
More informationAutomated Reasoning PROLOG and Automated Reasoning 13.4 Further Issues in Automated Reasoning 13.5 Epilogue and References 13.
13 Automated Reasoning 13.0 Introduction to Weak Methods in Theorem Proving 13.1 The General Problem Solver and Difference Tables 13.2 Resolution Theorem Proving 13.3 PROLOG and Automated Reasoning 13.4
More informationFoundations. Yu Zhang. Acknowledgement: modified from Stanford CS242
Spring 2013 Foundations Yu Zhang Acknowledgement: modified from Stanford CS242 https://courseware.stanford.edu/pg/courses/317431/ Course web site: http://staff.ustc.edu.cn/~yuzhang/fpl Reading Concepts
More informationCSC173 Lambda Calculus Lambda Calculus Evaluation (10 min) Evaluate this expression (β-reduce with normal-order evaluation):
CSC173 Lambda Calculus 014 Please write your name on the bluebook. You may use two sides of handwritten notes. There are 90 possible points and 75 is a perfect score. Stay cool and please write neatly.
More informationHarvard School of Engineering and Applied Sciences CS 152: Programming Languages
Harvard School of Engineering and Applied Sciences CS 152: Programming Languages Lecture 14 Tuesday, March 24, 2015 1 Parametric polymorphism Polymorph means many forms. Polymorphism is the ability of
More informationCMSC 330: Organization of Programming Languages. Lambda Calculus
CMSC 330: Organization of Programming Languages Lambda Calculus 1 Turing Completeness Turing machines are the most powerful description of computation possible They define the Turing-computable functions
More information1 Scope, Bound and Free Occurrences, Closed Terms
CS 6110 S18 Lecture 2 The λ-calculus Last time we introduced the λ-calculus, a mathematical system for studying the interaction of functional abstraction and functional application. We discussed the syntax
More informationThe Metalanguage λprolog and Its Implementation
The Metalanguage λprolog and Its Implementation Gopalan Nadathur Computer Science Department University of Minnesota (currently visiting INRIA and LIX) 1 The Role of Metalanguages Many computational tasks
More informationCSE-321 Programming Languages 2011 Final
Name: Hemos ID: CSE-321 Programming Languages 2011 Final Prob 1 Prob 2 Prob 3 Prob 4 Prob 5 Prob 6 Total Score Max 15 15 10 17 18 25 100 There are six problems on 18 pages in this exam, including one extracredit
More informationCSE 505: Concepts of Programming Languages
CSE 505: Concepts of Programming Languages Dan Grossman Fall 2003 Lecture 6 Lambda Calculus Dan Grossman CSE505 Fall 2003, Lecture 6 1 Where we are Done: Modeling mutation and local control-flow Proving
More informationAnnouncements. The current topic: Scheme. Review: BST functions. Review: Representing trees in Scheme. Reminder: Lab 2 is due on Monday at 10:30 am.
The current topic: Scheme! Introduction! Object-oriented programming: Python Functional programming: Scheme! Introduction! Numeric operators, REPL, quotes, functions, conditionals! Function examples, helper
More informationFunctions as data. Massimo Merro. 9 November Massimo Merro The Lambda language 1 / 21
Functions as data Massimo Merro 9 November 2011 Massimo Merro The Lambda language 1 / 21 The core of sequential programming languages In the mid 1960s, Peter Landin observed that a complex programming
More informationλ calculus is inconsistent
Content Rough timeline COMP 4161 NICTA Advanced Course Advanced Topics in Software Verification Gerwin Klein, June Andronick, Toby Murray λ Intro & motivation, getting started [1] Foundations & Principles
More informationThe Untyped Lambda Calculus
CS738: Advanced Compiler Optimizations The Untyped Lambda Calculus Amey Karkare karkare@cse.iitk.ac.in http://www.cse.iitk.ac.in/~karkare/cs738 Department of CSE, IIT Kanpur Reference Book Types and Programming
More informationLambda Calculus and Type Inference
Lambda Calculus and Type Inference Björn Lisper Dept. of Computer Science and Engineering Mälardalen University bjorn.lisper@mdh.se http://www.idt.mdh.se/ blr/ October 13, 2004 Lambda Calculus and Type
More informationCMSC 330: Organization of Programming Languages
CMSC 330: Organization of Programming Languages Lambda Calculus Encodings CMSC 330 Spring 2017 1 Review A lambda calculus expression is defined as e ::= x variable λx.e abstraction (fun def) e e application
More information6.1 Basics of functional type theory, semantics of serial verbs via function composition.
PART 6. SEMANTIC PARSING OF THE VERB CLUSTER IN DUTCH AND GERMAN 6.1 Basics of functional type theory, semantics of serial verbs via function composition. Basics of functional type theory (ignoring intensionality)
More informationAn Inverse Lambda Calculus Algorithm. For Natural Language Processing. Marcos Alvarez Gonzalez
An Inverse Lambda Calculus Algorithm For Natural Language Processing by Marcos Alvarez Gonzalez A Thesis Presented In Partial Fulfillment of the Requirements for the Degree Master of Science Approved November
More informationLambda Calculus-2. Church Rosser Property
Lambda Calculus-2 Church-Rosser theorem Supports referential transparency of function application Says if it exists, normal form of a term is UNIQUE 1 Church Rosser Property Fundamental result of λ-calculus:
More informationTable of Contents Week I Monday: First-Order Logic... Slide 7 Tuesday: Lambda Calculus (I)... Slide 48 Wednesday: Lambda Calculus (II)... Slide 87 Thu
An Introduction to Computational Semantics by Patrick Blackburn & Johan Bos August 6, 2001 Foundational Course, ESSLLI XIII, Helsinki, 13-24 August, 2001 Table of Contents Week I Monday: First-Order Logic...
More information301AA - Advanced Programming
301AA - Advanced Programming Lecturer: Andrea Corradini andrea@di.unipi.it h;p://pages.di.unipi.it/corradini/ Course pages: h;p://pages.di.unipi.it/corradini/dida@ca/ap-18/ AP-2018-18: Lambda Calculus,
More informationLambda Calculus. Lambda Calculus
Lambda Calculus Formalism to describe semantics of operations in functional PLs Variables are free or bound Function definition vs function abstraction Substitution rules for evaluating functions Normal
More informationINTENSIONAL LOGIC TRANSLATION FOR QUANTITATIVE NATURAL LANGUAGE SENTENCES
STUDIA UNIV. BABEŞ BOLYAI, INFORMATICA, Volume XLV, Number 1, 2001 INTENSIONAL LOGIC TRANSLATION FOR QUANTITATIVE NATURAL LANGUAGE SENTENCES ADRIAN ONEŢ, DOINA TĂTAR Abstract. The performance of some natural
More informationCMSC 330: Organization of Programming Languages
CMSC 330: Organization of Programming Languages Lambda Calculus CMSC 330 Summer 2017 1 100 years ago Albert Einstein proposed special theory of relativity in 1905 In the paper On the Electrodynamics of
More informationClass Intro & Compositional Semantics & Others
LING 147. Semantics of Questions Week 1 Yimei Xiang September 1, 2016 1 Class intro Class Intro & Compositional Semantics & Others What does a declarative denote? A declarative denotes a proposition. Its
More informationCMSC 330: Organization of Programming Languages. Lambda Calculus
CMSC 330: Organization of Programming Languages Lambda Calculus 1 100 years ago Albert Einstein proposed special theory of relativity in 1905 In the paper On the Electrodynamics of Moving Bodies 2 Prioritätsstreit,
More information