• Aucun résultat trouvé

Logic and Theoretical Computer Science

N/A
N/A
Protected

Academic year: 2022

Partager "Logic and Theoretical Computer Science"

Copied!
8
0
0

Texte intégral

(1)

Logic and Theoretical Computer Science

Akim Demaille [email protected]

EPITA — École Pour l’Informatique et les Techniques Avancées

June 10, 2016

(2)

Logic and Theoretical Computer Science

1

Lambda calculus

2

Simply typed lambda calculus

3

Natural deduction for classical logic

4

Sequent calculus, cut elimination

5

Lambda Calculus / Deduction systems

6

Intuitionistic logic

7

Curry-Howard isomorphism

A. Demaille Logic and Theoretical Computer Science 2 / 2

(3)

Logic and Theoretical Computer Science

1

Lambda calculus

2

Simply typed lambda calculus

3

Natural deduction for classical logic

4

Sequent calculus, cut elimination

5

Lambda Calculus / Deduction systems

6

Intuitionistic logic

7

Curry-Howard isomorphism

A. Demaille Logic and Theoretical Computer Science 2 / 2

(4)

Logic and Theoretical Computer Science

1

Lambda calculus

2

Simply typed lambda calculus

3

Natural deduction for classical logic

4

Sequent calculus, cut elimination

5

Lambda Calculus / Deduction systems

6

Intuitionistic logic

7

Curry-Howard isomorphism

A. Demaille Logic and Theoretical Computer Science 2 / 2

(5)

Logic and Theoretical Computer Science

1

Lambda calculus

2

Simply typed lambda calculus

3

Natural deduction for classical logic

4

Sequent calculus, cut elimination

5

Lambda Calculus / Deduction systems

6

Intuitionistic logic

7

Curry-Howard isomorphism

A. Demaille Logic and Theoretical Computer Science 2 / 2

(6)

Logic and Theoretical Computer Science

1

Lambda calculus

2

Simply typed lambda calculus

3

Natural deduction for classical logic

4

Sequent calculus, cut elimination

5

Lambda Calculus / Deduction systems

6

Intuitionistic logic

7

Curry-Howard isomorphism

A. Demaille Logic and Theoretical Computer Science 2 / 2

(7)

Logic and Theoretical Computer Science

1

Lambda calculus

2

Simply typed lambda calculus

3

Natural deduction for classical logic

4

Sequent calculus, cut elimination

5

Lambda Calculus / Deduction systems

6

Intuitionistic logic

7

Curry-Howard isomorphism

A. Demaille Logic and Theoretical Computer Science 2 / 2

(8)

Logic and Theoretical Computer Science

1

Lambda calculus

2

Simply typed lambda calculus

3

Natural deduction for classical logic

4

Sequent calculus, cut elimination

5

Lambda Calculus / Deduction systems

6

Intuitionistic logic

7

Curry-Howard isomorphism

A. Demaille Logic and Theoretical Computer Science 2 / 2

Références

Documents relatifs

• For any PosRA accGBy query not using any product operator and with a finite and position-invariant accumulation operator, POSS and CERT are in PTIME on po-databases whose

By (1) analyzing several characteristics of four types of cross cells and (2) presenting three cycle-merging operations and one extension operation, we propose an algorithm that

The annual conference of the European Association for Computer Science Logic (EACSL), CSL 2012, was held in Fontainebleau, France, from 3 to 6 September 2012. CSL started as a series

&calculus, using the distinction between call-by-value and call-by-name. It is held that the re- lationship should be mediated by a standardisation

Expliquez de quelle manière des observations géodésiques répétées peuvent être utilisées pour décrire l' « inclinaison » d'une structure.. À l'aide d'explications, comparez

Hence, any algorithmic procedure for testing whether a formula is true (or equivalently, by G¨odel’s completeness theorem, provable in a complete system) must run forever when

Thus analyzing the worst-case running time of a branching algorithm means determining the maximum number of nodes in a search tree corresponding to the execution of the algorithm on

SAT Satisfiability problem SCFQ Self-Clocked Fair Queueing SCSP Shortcut Span Protection SDH Synchronous Digital Hierarchy SFQ Start-time Fair Queueing SIFS Short Inter-Frame Space