• Aucun résultat trouvé

[PDF] Top 20 Incrementality and effect simulation in the simply typed lambda calculus

Has 10000 "Incrementality and effect simulation in the simply typed lambda calculus" found on our website. Below are the top 20 most common "Incrementality and effect simulation in the simply typed lambda calculus".

Incrementality and effect simulation in the simply typed lambda calculus

Incrementality and effect simulation in the simply typed lambda calculus

... of the shortcomings of L tac is that tactics used to construct proofs are unsafe 7 ...Efficiency in theorem provers can also be gained by improving the machinery to guide and verify proofs, by ... Voir le document complet

135

A Lambda-calculus Structure Isomorphic to Gentzen-style Sequent Calculus Structure

A Lambda-calculus Structure Isomorphic to Gentzen-style Sequent Calculus Structure

... While the structure of the usual  -calculus is isomorphic to the structure of natural deduction, this new structure is isomorphic to the structure of Gentzen-style sequent ...express ... Voir le document complet

16

A continuation-passing-style interpretation of simply-typed call-by-need λ-calculus with control within System F

A continuation-passing-style interpretation of simply-typed call-by-need λ-calculus with control within System F

... (1993): The Call-By-Need Lambda ...Calculi: The Unity of Semantic Artifacts. In Tom Schrijvers & Peter Thiemann, editors: Functional and Logic Programming - 11th International ... Voir le document complet

13

Inhabitation in simply typed lambda-calculus through a lambda-calculus for proof search

Inhabitation in simply typed lambda-calculus through a lambda-calculus for proof search

... sound and complete in terms of membership: Lemma 28 (Coinductive ...Proof. The direction from left to right (soundness) is immediate by induction on finfin, using Lemma ...on the sum of ... Voir le document complet

34

Call-by-Value Lambda-calculus and LJQ

Call-by-Value Lambda-calculus and LJQ

... redexes. The precise definition of which redexes are adminis- trative is crucial, since this choice might or might not make the refined Fischer translation a Galois connection or a reflection (Definition ... Voir le document complet

25

Non-idempotent typing operators, beyond the lambda-calculus

Non-idempotent typing operators, beyond the lambda-calculus

... is the function n 7→ 3 × n + 1, the program g from Nat to Nat, that takes a natural number n as input and outputs f(n + 2), can be executed in this manner: g(n) → β f(n + 2) → β 3 × (n + 2) + ... Voir le document complet

370

A lambda-calculus with constructors

A lambda-calculus with constructors

... of the reasons of the success of the -calculus in computer science and in logic lies in its excellent operational semantics in the untyped ...case. ... Voir le document complet

24

The Sensible Graph Theories of Lambda Calculus

The Sensible Graph Theories of Lambda Calculus

... Further results of the paper are: i the existence of a continuum of different sensible graph theories strictly included in this result positively answers Question 2 in [7, Section 6.3]; [r] ... Voir le document complet

11

The Minimal Graph Model of Lambda Calculus

The Minimal Graph Model of Lambda Calculus

... Is there a continuous stable, strongly stable model whose theory is exactly or where is the minimal lambda theory and is the minimal extensional lambda theory?. Question 1 can be we[r] ... Voir le document complet

10

Full abstraction for the quantum lambda-calculus

Full abstraction for the quantum lambda-calculus

... recently. The same year as the first adequate denotational model for the quantum λ-calculus, also in POPL’14, Ehrhard, Tasson and Pagani presented a proof that probabilistic ... Voir le document complet

29

The Calculus of explicit substitutions lambda-upsilon

The Calculus of explicit substitutions lambda-upsilon

... L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignemen[r] ... Voir le document complet

28

On the confluence of lambda-calculus with conditional rewriting

On the confluence of lambda-calculus with conditional rewriting

... investigated in the pure first-order setting (e.g. [Mid91, Gra96]), to the best of our knowledge, there was up to now no result on the preservation of confluence for the combination ... Voir le document complet

44

Functional Back-Ends within the Lambda-Sigma Calculus

Functional Back-Ends within the Lambda-Sigma Calculus

... L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignemen[r] ... Voir le document complet

47

Towards a lambda-calculus for concurrent and communicating systems

Towards a lambda-calculus for concurrent and communicating systems

... L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignemen[r] ... Voir le document complet

15

A call-by-name lambda-calculus machine

A call-by-name lambda-calculus machine

... In the first section, we give a rather informal, but complete, descrip- tion of the ...machine. In the second part, definitions are formalized, which allows us to give a proof of ... Voir le document complet

13

Metatheoretic Results for a Modal Lambda Calculus

Metatheoretic Results for a Modal Lambda Calculus

... 101 - 54602 Villers lès Nancy Cedex France Unité de recherche INRIA Rennes : IRISA, Campus universitaire de Beaulieu - 35042 Rennes Cedex France Unité de recherche INRIA Rhône-Alpes : 65[r] ... Voir le document complet

42

Graph models of lambda-calculus at work, and variations

Graph models of lambda-calculus at work, and variations

... The free ompletion method in K; G oh ; and Ghy oh : S ott's model D1 and Park's model P1 are the extensional ompletions of the graph models P and P 0 In parti ular D1 is generated by a p[r] ... Voir le document complet

41

A Modal Lambda Calculus with Iteration and Case Constructs

A Modal Lambda Calculus with Iteration and Case Constructs

... 101 - 54602 Villers lès Nancy Cedex France Unité de recherche INRIA Rennes : IRISA, Campus universitaire de Beaulieu - 35042 Rennes Cedex France Unité de recherche INRIA Rhône-Alpes : 65[r] ... Voir le document complet

46

Some syntactic and categorical constructions of lambda-calculus models

Some syntactic and categorical constructions of lambda-calculus models

... L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignemen[r] ... Voir le document complet

52

On the discriminating power of tests in resource lambda-calculus

On the discriminating power of tests in resource lambda-calculus

... τ∂λ-calculus In differential proof nets the 0-ary tensor and the 0-ary par can be added freely in the sense that we still have a natural interpretation in MRel ... Voir le document complet

11

Show all 10000 documents...