66

Principles of Programming Languages Lecture 4: Semantics Andrei Arusoaie 1 1 Department of Computer Science October 26, 2020

Principles of Programming Languages Lecture 4: Semanticsarusoaie.andrei/lectures/PLP/...Semantic - informal Informal semantics (examples):natural language Rationale for the ANSI C

Download PDF Report

Upload
others
View
3
Download
0

Embed Size (px)

Citation preview

Principles of Programming LanguagesLecture 4: Semantics

Andrei Arusoaie1

1Department of Computer Science

October 26, 2020
Outline

Semantics: introduction

A simple imperative language
Semantics: motivation

C

-$ cat test.cint main(){int x;return (x=1) + (x=2);

}-$ gcc test.c-$ ./a.out ; echo $?4

Java

-$ cat File.javapublic class File {... void main(...) {

int x = 0;println((x=1) + (x=2));

}}-$ javac File.java-$ java File3
Semantics: motivation

C

-$ cat test.cint main(){int x;return (x=1) + (x=2);

}-$ gcc test.c-$ ./a.out ; echo $?4

Java

-$ cat File.javapublic class File {... void main(...) {

int x = 0;println((x=1) + (x=2));

}}-$ javac File.java-$ java File3
Semantics: motivation

C

-$ cat test.cint main(){int x;return (x=1) + (x=2);

}-$ gcc test.c-$ ./a.out ; echo $?4

Java

-$ cat File.javapublic class File {... void main(...) {

int x = 0;println((x=1) + (x=2));

}}-$ javac File.java-$ java File3
Semantics: motivation

GCC: 5.4.0-6 ubuntu

-$ cat test.cint main(){int x;return (x=1) + (x=2);

}-$ gcc test.c-$ ./a.out ; echo $?4

GCC: LLVM version 9.0.0 - clang

-$ cat test.cint main(){int x;return (x=1) + (x=2);

}-$ gcc test.c-$ ./a.out ; echo $?3
Semantics: motivation

GCC: 5.4.0-6 ubuntu

-$ cat test.cint main(){int x;return (x=1) + (x=2);

}-$ gcc test.c-$ ./a.out ; echo $?4

GCC: LLVM version 9.0.0 - clang

-$ cat test.cint main(){int x;return (x=1) + (x=2);

}-$ gcc test.c-$ ./a.out ; echo $?3
Semantics: motivation

GCC: 5.4.0-6 ubuntu

-$ cat test.cint main(){int x;return (x=1) + (x=2);

}-$ gcc test.c-$ ./a.out ; echo $?4

GCC: LLVM version 9.0.0 - clang

-$ cat test.cint main(){int x;return (x=1) + (x=2);

}-$ gcc test.c-$ ./a.out ; echo $?3
Semantics: motivation

GCC: 5.4.0-6 ubuntu

-$ cat test.cint main(){int x;return (x=1) + (x=2);

}-$ gcc test.c-$ ./a.out ; echo $?4

GCC: LLVM version 9.0.0 - clang

-$ cat test.cint main(){int x;return (x=1) + (x=2);

}-$ gcc test.c-$ ./a.out ; echo $?3
Demo

I out-of-lifetime.c
Semantics

I Semantics is concerned with the meaning of languageconstructs

I Semantics must be unambiguousI Semantics must be flexible
Semantic - informal

Informal semantics (examples): natural language

Rationale for the ANSI C Programming Language:I “Trust the programmer”I “Don’t prevent the programmer from doing what needs to

be done”I “Keep the language small and simple”I “Provide only one way to do an operation”I “Make it fast, even if it is not guaranteed to be portable”

Inexact! – could lead to undefined behavior in programs
Semantic - informal

Informal semantics (examples): natural language

Rationale for the ANSI C Programming Language:I “Trust the programmer”I “Don’t prevent the programmer from doing what needs to

be done”I “Keep the language small and simple”I “Provide only one way to do an operation”I “Make it fast, even if it is not guaranteed to be portable”

Inexact! – could lead to undefined behavior in programs
Semantic - informal

Informal semantics (examples): natural language

Rationale for the ANSI C Programming Language:I “Trust the programmer”I “Don’t prevent the programmer from doing what needs to

be done”I “Keep the language small and simple”I “Provide only one way to do an operation”I “Make it fast, even if it is not guaranteed to be portable”

Inexact! – could lead to undefined behavior in programs
Semantic - informal

Informal semantics (examples): natural language

Rationale for the ANSI C Programming Language:I “Trust the programmer”I “Don’t prevent the programmer from doing what needs to

be done”I “Keep the language small and simple”I “Provide only one way to do an operation”I “Make it fast, even if it is not guaranteed to be portable”

Inexact! – could lead to undefined behavior in programs
Semantic - informal

Informal semantics (examples): natural language

Rationale for the ANSI C Programming Language:I “Trust the programmer”I “Don’t prevent the programmer from doing what needs to

be done”I “Keep the language small and simple”I “Provide only one way to do an operation”I “Make it fast, even if it is not guaranteed to be portable”

Inexact! – could lead to undefined behavior in programs
Semantic - informal

Informal semantics (examples): natural language

Rationale for the ANSI C Programming Language:I “Trust the programmer”I “Don’t prevent the programmer from doing what needs to

be done”I “Keep the language small and simple”I “Provide only one way to do an operation”I “Make it fast, even if it is not guaranteed to be portable”

Inexact! – could lead to undefined behavior in programs
Semantic - informal

Informal semantics (examples): natural language

Rationale for the ANSI C Programming Language:I “Trust the programmer”I “Don’t prevent the programmer from doing what needs to

be done”I “Keep the language small and simple”I “Provide only one way to do an operation”I “Make it fast, even if it is not guaranteed to be portable”

Inexact! – could lead to undefined behavior in programs
Semantic styles

Some (formal) semantics styles:I operationalI denotationalI axiomatic

We will focus more on operational semantics styles: Small-stepSOS, Big-Step SOS
Semantic styles

Some (formal) semantics styles:I operationalI denotationalI axiomatic

We will focus more on operational semantics styles: Small-stepSOS, Big-Step SOS
A simple imperative language

Program:

n ::= 10;;i ::= 1;;sum ::= 0;;while (i «= n) do

sum ::= sum +’ i;;i ::= i +’ 1

end

Features:I variablesI arithmetic expressionsI boolean expressionsI assignment statementsI loop statementsI decisional statements

How can we define the semantics of this language?
A simple imperative language

Program:

n ::= 10;;i ::= 1;;sum ::= 0;;while (i «= n) do

sum ::= sum +’ i;;i ::= i +’ 1

end

Features:I variablesI arithmetic expressionsI boolean expressionsI assignment statementsI loop statementsI decisional statements

How can we define the semantics of this language?
A simple imperative language

Program:

n ::= 10;;i ::= 1;;sum ::= 0;;while (i «= n) do

sum ::= sum +’ i;;i ::= i +’ 1

end

Features:I variablesI arithmetic expressionsI boolean expressionsI assignment statementsI loop statementsI decisional statements

How can we define the semantics of this language?
A simple imperative language

Program:

n ::= 10;;i ::= 1;;sum ::= 0;;while (i «= n) do

sum ::= sum +’ i;;i ::= i +’ 1

end

Features:I variablesI arithmetic expressionsI boolean expressionsI assignment statementsI loop statementsI decisional statements

How can we define the semantics of this language?
A simple imperative language

Program:

n ::= 10;;i ::= 1;;sum ::= 0;;while (i «= n) do

sum ::= sum +’ i;;i ::= i +’ 1

end

Features:I variablesI arithmetic expressionsI boolean expressionsI assignment statementsI loop statementsI decisional statements

How can we define the semantics of this language?
A simple imperative language

Program:

n ::= 10;;i ::= 1;;sum ::= 0;;while (i «= n) do

sum ::= sum +’ i;;i ::= i +’ 1

end

Features:I variablesI arithmetic expressionsI boolean expressionsI assignment statementsI loop statementsI decisional statements

How can we define the semantics of this language?
A simple imperative language

Program:

n ::= 10;;i ::= 1;;sum ::= 0;;while (i «= n) do

sum ::= sum +’ i;;i ::= i +’ 1

end

Features:I variablesI arithmetic expressionsI boolean expressionsI assignment statementsI loop statementsI decisional statements

How can we define the semantics of this language?
A simple imperative language

Program:

n ::= 10;;i ::= 1;;sum ::= 0;;while (i «= n) do

sum ::= sum +’ i;;i ::= i +’ 1

end

Features:I variablesI arithmetic expressionsI boolean expressionsI assignment statementsI loop statementsI decisional statements

How can we define the semantics of this language?
A simple imperative language

Program:

n ::= 10;;i ::= 1;;sum ::= 0;;while (i «= n) do

sum ::= sum +’ i;;i ::= i +’ 1

end

Features:I variablesI arithmetic expressionsI boolean expressionsI assignment statementsI loop statementsI decisional statements

How can we define the semantics of this language?
Variables

I variable = storage location at address + symbolic nameI variables can be accessed or modifiedI depending on the language, they may only be able to store

a specified datatype (e.g., integer, string, etc.)I Scope: global, localI Lifetime (extent)I var_name 7→ value

I Environment + memory
Variables

I variable = storage location at address + symbolic nameI variables can be accessed or modifiedI depending on the language, they may only be able to store

a specified datatype (e.g., integer, string, etc.)I Scope: global, localI Lifetime (extent)I var_name 7→ value

I Environment + memory
Variables

I variable = storage location at address + symbolic nameI variables can be accessed or modifiedI depending on the language, they may only be able to store

a specified datatype (e.g., integer, string, etc.)I Scope: global, localI Lifetime (extent)I var_name 7→ value

I Environment + memory
Variables

I variable = storage location at address + symbolic nameI variables can be accessed or modifiedI depending on the language, they may only be able to store

a specified datatype (e.g., integer, string, etc.)I Scope: global, localI Lifetime (extent)I var_name 7→ value

I Environment + memory
Variables

I variable = storage location at address + symbolic nameI variables can be accessed or modifiedI depending on the language, they may only be able to store

a specified datatype (e.g., integer, string, etc.)I Scope: global, localI Lifetime (extent)I var_name 7→ value

I Environment + memory
Variables

I variable = storage location at address + symbolic nameI variables can be accessed or modifiedI depending on the language, they may only be able to store

a specified datatype (e.g., integer, string, etc.)I Scope: global, localI Lifetime (extent)I var_name 7→ value

I Environment + memory
Variables

I variable = storage location at address + symbolic nameI variables can be accessed or modifiedI depending on the language, they may only be able to store

a specified datatype (e.g., integer, string, etc.)I Scope: global, localI Lifetime (extent)I var_name 7→ value

I Environment + memory
Variables in Coq

I Declaration:Inductive Var := n | i | sum.Definition var_eq (v1 v2 : Var) :=match v1, v2 with

| n, n => true| i, i => true| sum, sum => true| _, _ => false

end.
Environment

I Environment: variables mapped to valuesDefinition Env := Var -> nat.Definition env (var : Var) := if (var_eq var n)

then 10else 0.

Compute (env n).= 10: natCompute (env i).= 0: natCheck env.env:

: Var -> nat

I The environment is a function!
Environment update

I Update = a new function s.t. the value for x is updated to v:

Definition update (x : Var)(v : nat)(env : Env) : Env :=fun y => if (var_eq x y)

then velse env y.
Arithmetic expressions

I Syntax:

BNF:AExp ::= N

| AExp ‘+’ AExp| AExp ‘*’ AExp

Inductive AExp :=| anum : nat -> AExp| aplus : AExp -> AExp -> AExp| amul : AExp -> AExp -> AExp.

I Semantics:

Fixpoint aeval (a : AExp) : nat :=match a with| anum v => v| aplus a1 a2 => (aeval a1) + (aeval a2)| amul a1 a2 => (aeval a1) * (aeval a2)end.

I What about expressions in a PL: i ::= i +’ 1;; ?
Arithmetic expressions

I Syntax:

BNF:AExp ::= N

| AExp ‘+’ AExp| AExp ‘*’ AExp

Inductive AExp :=| anum : nat -> AExp| aplus : AExp -> AExp -> AExp| amul : AExp -> AExp -> AExp.

I Semantics:

Fixpoint aeval (a : AExp) : nat :=match a with| anum v => v| aplus a1 a2 => (aeval a1) + (aeval a2)| amul a1 a2 => (aeval a1) * (aeval a2)end.

I What about expressions in a PL: i ::= i +’ 1;; ?
Arithmetic expressions

I Syntax:

BNF:AExp ::= N

| AExp ‘+’ AExp| AExp ‘*’ AExp

Inductive AExp :=| anum : nat -> AExp| aplus : AExp -> AExp -> AExp| amul : AExp -> AExp -> AExp.

I Semantics:

Fixpoint aeval (a : AExp) : nat :=match a with| anum v => v| aplus a1 a2 => (aeval a1) + (aeval a2)| amul a1 a2 => (aeval a1) * (aeval a2)end.

I What about expressions in a PL: i ::= i +’ 1;; ?
Arithmetic expressions

I Syntax:

BNF:AExp ::= N

| AExp ‘+’ AExp| AExp ‘*’ AExp

Inductive AExp :=| anum : nat -> AExp| aplus : AExp -> AExp -> AExp| amul : AExp -> AExp -> AExp.

I Semantics:

Fixpoint aeval (a : AExp) : nat :=match a with| anum v => v| aplus a1 a2 => (aeval a1) + (aeval a2)| amul a1 a2 => (aeval a1) * (aeval a2)end.

I What about expressions in a PL: i ::= i +’ 1;; ?
Arithmetic expressions with variables

I Syntax:

BNF:AExp ::= Var

| N| AExp ‘+’ AExp| AExp ‘*’ AExp

Inductive AExp :=| var : Var -> AExp| anum : nat -> AExp| aplus : AExp -> AExp -> AExp| amul : AExp -> AExp -> AExp.

I Semantics:

Fixpoint aeval (a : AExp) : nat :=match a with| var v => ???| anum v => v| aplus a1 a2 => (aeval a1) + (aeval a2)| amul a1 a2 => (aeval a1) * (aeval a2)end.

I We need an environment to evaluate expressions withvariables!
Arithmetic expressions with variables

I Syntax:

BNF:AExp ::= Var

| N| AExp ‘+’ AExp| AExp ‘*’ AExp

Inductive AExp :=| var : Var -> AExp| anum : nat -> AExp| aplus : AExp -> AExp -> AExp| amul : AExp -> AExp -> AExp.

I Semantics:

Fixpoint aeval (a : AExp) : nat :=match a with| var v => ???| anum v => v| aplus a1 a2 => (aeval a1) + (aeval a2)| amul a1 a2 => (aeval a1) * (aeval a2)end.

I We need an environment to evaluate expressions withvariables!
Arithmetic expressions with variables

I Syntax:

BNF:AExp ::= Var

| N| AExp ‘+’ AExp| AExp ‘*’ AExp

Inductive AExp :=| var : Var -> AExp| anum : nat -> AExp| aplus : AExp -> AExp -> AExp| amul : AExp -> AExp -> AExp.

I Semantics:

Fixpoint aeval (a : AExp) : nat :=match a with| var v => ???| anum v => v| aplus a1 a2 => (aeval a1) + (aeval a2)| amul a1 a2 => (aeval a1) * (aeval a2)end.

I We need an environment to evaluate expressions withvariables!
Arithmetic expressions with variables

I Syntax:

BNF:AExp ::= Var

| N| AExp ‘+’ AExp| AExp ‘*’ AExp

Inductive AExp :=| var : Var -> AExp| anum : nat -> AExp| aplus : AExp -> AExp -> AExp| amul : AExp -> AExp -> AExp.

I Semantics:

Fixpoint aeval (a : AExp) : nat :=match a with| var v => ???| anum v => v| aplus a1 a2 => (aeval a1) + (aeval a2)| amul a1 a2 => (aeval a1) * (aeval a2)end.

I We need an environment to evaluate expressions withvariables!
Evaluate expression with variablesI Semantics:

Fixpoint aeval (a : AExp) (env : Env) : nat :=match a with| var v => env v| anum v => v| aplus a1 a2 => (aeval a1 env) + (aeval a2 env)| amul a1 a2 => (aeval a1 env) * (aeval a2 env)end.

I Notations and testing:Coercion var : Var >-> AExp.Coercion anum : nat >-> AExp.Notation "A +’ B" := (aplus A B) (at level 49).Notation "A *’ B" := (amul A B) (at level 48).Compute aeval (2 +’ 3 *’ 4) env.= 14: natCompute env n.= 10: natCompute aeval (2 +’ 3 *’ n) env.= 32: nat
Boolean expressions

I Syntax:Inductive BExp :=| btrue : BExp| bfalse : BExp| blessthan : AExp -> AExp -> BExp| band : BExp -> BExp -> BExp| bnot : BExp -> BExp.

I Semantics:Fixpoint beval (b : BExp) (env : Env) : bool :=match b with| btrue => true| bfalse => false| blessthan a1 a2 => Nat.leb (aeval a1 env) (aeval a2 env)| band b1 b2 => andb (beval b1 env) (beval b2 env)| bnot b’ => negb (beval b’ env)end.
Boolean expressions

I Syntax:Inductive BExp :=| btrue : BExp| bfalse : BExp| blessthan : AExp -> AExp -> BExp| band : BExp -> BExp -> BExp| bnot : BExp -> BExp.

I Semantics:Fixpoint beval (b : BExp) (env : Env) : bool :=match b with| btrue => true| bfalse => false| blessthan a1 a2 => Nat.leb (aeval a1 env) (aeval a2 env)| band b1 b2 => andb (beval b1 env) (beval b2 env)| bnot b’ => negb (beval b’ env)end.
Assignments

I Syntax:Inductive Stmt :=| assignment : Var -> AExp -> Stmt.Notation "A ::= B" := (assignment A B) (at level 54).Check n ::= 100 .n ::= 100

: Stmt

I Assignments modify the environmentI Semantics:

Fixpoint eval (s : Stmt) (env : Env) : Env :=match s with| assignment x a => update x (aeval a env) envend.

I (eval (n ::= 100) env) is of type Env!
Assignments

I Syntax:Inductive Stmt :=| assignment : Var -> AExp -> Stmt.Notation "A ::= B" := (assignment A B) (at level 54).Check n ::= 100 .n ::= 100

: Stmt

I Assignments modify the environmentI Semantics:

Fixpoint eval (s : Stmt) (env : Env) : Env :=match s with| assignment x a => update x (aeval a env) envend.

I (eval (n ::= 100) env) is of type Env!
Assignments

I Syntax:Inductive Stmt :=| assignment : Var -> AExp -> Stmt.Notation "A ::= B" := (assignment A B) (at level 54).Check n ::= 100 .n ::= 100

: Stmt

I Assignments modify the environmentI Semantics:

Fixpoint eval (s : Stmt) (env : Env) : Env :=match s with| assignment x a => update x (aeval a env) envend.

I (eval (n ::= 100) env) is of type Env!
Assignments

I Syntax:Inductive Stmt :=| assignment : Var -> AExp -> Stmt.Notation "A ::= B" := (assignment A B) (at level 54).Check n ::= 100 .n ::= 100

: Stmt

I Assignments modify the environmentI Semantics:

Fixpoint eval (s : Stmt) (env : Env) : Env :=match s with| assignment x a => update x (aeval a env) envend.

I (eval (n ::= 100) env) is of type Env!
Assignments

I Syntax:Inductive Stmt :=| assignment : Var -> AExp -> Stmt.Notation "A ::= B" := (assignment A B) (at level 54).Check n ::= 100 .n ::= 100

: Stmt

I Assignments modify the environmentI Semantics:

Fixpoint eval (s : Stmt) (env : Env) : Env :=match s with| assignment x a => update x (aeval a env) envend.

I (eval (n ::= 100) env) is of type Env!
Programs: sequence of statements

I Syntax:Inductive Stmt :=...| seq s1 s2 => eval s2 (eval s1 env)...Notation "S S’" := (assignment S S’) (at level 54).Check n ::= 100 ;; i ::= 7 .n ::= 100 ;; i ::= 7

: Stmt

I Semantics:Fixpoint eval (s : Stmt) (env : Env) : Env :=match s with...| seq s1 s2 => eval s2 (eval s1 env)end.
Programs: sequence of statements

I Syntax:Inductive Stmt :=...| seq s1 s2 => eval s2 (eval s1 env)...Notation "S S’" := (assignment S S’) (at level 54).Check n ::= 100 ;; i ::= 7 .n ::= 100 ;; i ::= 7

: Stmt

I Semantics:Fixpoint eval (s : Stmt) (env : Env) : Env :=match s with...| seq s1 s2 => eval s2 (eval s1 env)end.
Programs: sequence of statements

I Syntax:Inductive Stmt :=...| seq s1 s2 => eval s2 (eval s1 env)...Notation "S S’" := (assignment S S’) (at level 54).Check n ::= 100 ;; i ::= 7 .n ::= 100 ;; i ::= 7

: Stmt

I Semantics:Fixpoint eval (s : Stmt) (env : Env) : Env :=match s with...| seq s1 s2 => eval s2 (eval s1 env)end.
Loops

I Syntax:Inductive Stmt :=...| while : BExp -> Stmt -> Stmt....

I Semantics:Fixpoint eval (s : Stmt) (env : Env) : Env :=match s with...| while b s’ => if (beval b env)

then (eval (seq s’ (while b s’)) env)else env

end.

I ERROR:Error: Cannot guess decreasing argument of fix.

I Solution: define eval as a relation!
Loops

I Syntax:Inductive Stmt :=...| while : BExp -> Stmt -> Stmt....

I Semantics:Fixpoint eval (s : Stmt) (env : Env) : Env :=match s with...| while b s’ => if (beval b env)

then (eval (seq s’ (while b s’)) env)else env

end.

I ERROR:Error: Cannot guess decreasing argument of fix.

I Solution: define eval as a relation!
Loops

I Syntax:Inductive Stmt :=...| while : BExp -> Stmt -> Stmt....

I Semantics:Fixpoint eval (s : Stmt) (env : Env) : Env :=match s with...| while b s’ => if (beval b env)

then (eval (seq s’ (while b s’)) env)else env

end.

I ERROR:Error: Cannot guess decreasing argument of fix.

I Solution: define eval as a relation!
Evaluation as a relation

I Assignment:aeval a E = v

(eval (x ::= a) E (x 7→ v ; E)

I Sequence:eval s1 E1 E′ eval s2 E′ E2

(eval (seq s1 s2) E1 E2)

I Loop (true case):

beval b E1 = true eval s E1 E′ eval (while b s) E′ E2(eval (while b s) E1 E2)

I Loop (false case):beval b E = false

(eval (while b s) E E)
Evaluation as a relation

I Assignment:aeval a E = v

(eval (x ::= a) E (x 7→ v ; E)

I Sequence:eval s1 E1 E′ eval s2 E′ E2

(eval (seq s1 s2) E1 E2)

I Loop (true case):

beval b E1 = true eval s E1 E′ eval (while b s) E′ E2(eval (while b s) E1 E2)

I Loop (false case):beval b E = false

(eval (while b s) E E)
Evaluation as a relation

I Assignment:aeval a E = v

(eval (x ::= a) E (x 7→ v ; E)

I Sequence:eval s1 E1 E′ eval s2 E′ E2

(eval (seq s1 s2) E1 E2)

I Loop (true case):

beval b E1 = true eval s E1 E′ eval (while b s) E′ E2(eval (while b s) E1 E2)

I Loop (false case):beval b E = false

(eval (while b s) E E)
Evaluation as a relation

I Assignment:aeval a E = v

(eval (x ::= a) E (x 7→ v ; E)

I Sequence:eval s1 E1 E′ eval s2 E′ E2

(eval (seq s1 s2) E1 E2)

I Loop (true case):

beval b E1 = true eval s E1 E′ eval (while b s) E′ E2(eval (while b s) E1 E2)

I Loop (false case):beval b E = false

(eval (while b s) E E)
Bibliography

I Chapter Simple Imperative Programs in SoftwareFoundations - Volume 1, Benjamin C. Pierce, ArthurAzevedo de Amorim, Chris Casinghino, Marco Gaboardi,Michael Greenberg, Cătălin Hriţcu, Vilhelm Sjöberg,Andrew Tolmach, Brent Yorgeyhttps://softwarefoundations.cis.upenn.edu/lf-current/Imp.html

https://softwarefoundations.cis.upenn.edu/lf-current/Imp.htmlhttps://softwarefoundations.cis.upenn.edu/lf-current/Imp.html

Semantics: introductionA simple imperative language

Programming B. Wegbreit The Denotational Semantics of Programming Languages › ~andrea › Didattica › PLP-15 › DOCS › ... · 2015-10-29 · Programming Languages R.D. Tennent

Programming B. Wegbreit The Denotational Semantics of Programming Languages › ~andrea › Didattica › PLP-15 › DOCS › ... · 2015-10-29 · Programming Languages R.D. Tennent

Documents

PLP Substation 2009

PLP Substation 2009

Documents

The informal semantics of Answer Set Programming: A ... · The informal semantics of Answer Set Programming: A Tarskian perspective Marc Denecker Department of Computer Science, KU

The informal semantics of Answer Set Programming: A ... · The informal semantics of Answer Set Programming: A Tarskian perspective Marc Denecker Department of Computer Science, KU

Documents

Prestolok PLP Composite Push-to-Connect · PDF filePetoo PLP Cooite P-to-Connect Fittin Prestolok PLP Composite Push-to-Connect ... Prestolok PLP Composite Push-to-Connect Fittings

Prestolok PLP Composite Push-to-Connect · PDF filePetoo PLP Cooite P-to-Connect Fittin Prestolok PLP Composite Push-to-Connect ... Prestolok PLP Composite Push-to-Connect Fittings

Documents

Documents

Transgene PLP-CGT und PLP-CSTHA Mäuse

Transgene PLP-CGT und PLP-CSTHA Mäuse

Documents

Education

Plp presentation

Plp presentation

Lifestyle

Présentation PLP

Présentation PLP

Business

PLP ENGINEERING SERVICES PLP ENGINEERING SERVICESpreformed.com/au/images/Engineering_Services_Brochure... · 2017-09-11 · PLP Engineering Services can provide a complete turnkey

PLP ENGINEERING SERVICES PLP ENGINEERING SERVICESpreformed.com/au/images/Engineering_Services_Brochure... · 2017-09-11 · PLP Engineering Services can provide a complete turnkey

Documents

Informal Semantics of PL - Gillettebgillette.com/wp-content/uploads/2012/08/Informal-Semantics-of-PL1… · Informal Semantics of PL * * *In SL, if a sentence-letter (C) stood for

Informal Semantics of PL - Gillettebgillette.com/wp-content/uploads/2012/08/Informal-Semantics-of-PL1… · Informal Semantics of PL * * *In SL, if a sentence-letter (C) stood for

Documents

A Structural Operational Semantics for JavaScripttheory.stanford.edu/~ataly/Talks/OperSem-cs242Lec.pdf · · 2009-02-12Informal and Formal Semantics Informal semantics: Meaning

A Structural Operational Semantics for JavaScripttheory.stanford.edu/~ataly/Talks/OperSem-cs242Lec.pdf · · 2009-02-12Informal and Formal Semantics Informal semantics: Meaning

Documents

Principles of Programming Languages Lecture 3: Semantics · Semantic - informal Informal semantics (examples):natural language Rationale for the ANSI C Programming Language: I“Trust

Principles of Programming Languages Lecture 3: Semantics · Semantic - informal Informal semantics (examples):natural language Rationale for the ANSI C Programming Language: I“Trust

Documents

Documents

iTrojan PLP presentation

iTrojan PLP presentation

Education

Documents

Oct 2021 PLP#3 Peer Leadership Program PLP 6 month Training

Oct 2021 PLP#3 Peer Leadership Program PLP 6 month Training

Documents

PLP Guide1 Training Guide for Inzalo PLP Management

PLP Guide1 Training Guide for Inzalo PLP Management

Documents

J.C.sprott.physics.wisc.edu/technote/PLP/plp1014.pdf · Plasma Studies University of Wisconsin These PLP Reports are informal and preliminary and as such may contain errors not yet

J.C.sprott.physics.wisc.edu/technote/PLP/plp1014.pdf · Plasma Studies University of Wisconsin These PLP Reports are informal and preliminary and as such may contain errors not yet

Documents

Youth Plp Assessments

Youth Plp Assessments

Education

Documents

Normalisation. Informal guidelines Semantics of the attributes easy to explain relation doesn’t mix concepts Reducing the redundant values in

Normalisation. Informal guidelines Semantics of the attributes easy to explain relation doesn’t mix concepts Reducing the redundant values in

Documents

Laporan Pengamatan PLP

Laporan Pengamatan PLP

Documents

pedoman PLP REVISI4hareMhs

pedoman PLP REVISI4hareMhs

Documents

Education

PLP Application

PLP Application

Documents

$E:\Plp 2009 2\Plp Aula11$

E:\Plp 2009 2\Plp Aula11

Education

EYLF PLP e-Newsletter No. 20 2011 - EYLF PLP workshop materials

EYLF PLP e-Newsletter No. 20 2011 - EYLF PLP workshop materials

Documents

COMP219: Artificial Intelligencefransoliehoek.net/teaching/COMP219/lectures/COMP219_17_SemanticNets.pdf · • The semantics of a semantic net can be relatively informal or very formal

COMP219: Artificial Intelligencefransoliehoek.net/teaching/COMP219/lectures/COMP219_17_SemanticNets.pdf · • The semantics of a semantic net can be relatively informal or very formal

Documents

Plp comm catsec10_2010t

Plp comm catsec10_2010t

Business