• Aucun résultat trouvé

Haut PDF The Lambda-calculus with multiplicities

The Lambda-calculus with multiplicities

The Lambda-calculus with multiplicities

... 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] ...

33

Backpropagation in the Simply Typed Lambda-Calculus with Linear Negation

Backpropagation in the Simply Typed Lambda-Calculus with Linear Negation

... Backpropagation in the Simply Typed Lambda-calculus with Linear Negation ALOÏS BRUNEL, Deepomatic, France DAMIANO MAZZA, CNRS, UMR 7030, LIPN, Université Sorbonne Paris Nord, France MICH[r] ...

38

Lambda-Calculus, Multiplicities and the pi-Calculus

Lambda-Calculus, Multiplicities and the pi-Calculus

... Unite´ de recherche INRIA Lorraine, Technopoˆle de Nancy-Brabois, Campus scientifique, 615 rue du Jardin Botanique, BP 101, 54600 VILLERS LE`S NANCY Unite´ de recherche INRIA Rennes, Iri[r] ...

37

On the confluence of lambda-calculus with conditional rewriting

On the confluence of lambda-calculus with conditional rewriting

... assumed. However, it would be interesting to know if this restriction can be dropped. Problems arising from non left-linear rewriting are directly transposed to left-linear conditional rewriting. The semi-closure ...

44

Algebras and Coalgebras in the Light Affine Lambda Calculus

Algebras and Coalgebras in the Light Affine Lambda Calculus

... spirit the same approach focusing on the encoding of ...studied the expressivity of the different light logics by designing embeddings from the light logics to Lin- ear Logic by Level [ ...

13

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

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

... 1) With these rules, the rst proof above is not directly a proof in the restriction: the axiom rule of LJ has to be encoded in the restriction by an axiom rule followed by a contraction ...

16

A call-by-name lambda-calculus machine

A call-by-name lambda-calculus machine

... ii) with <ν − 1, i> if ν > the depth of this occurrence ; and after that, we replace this occurrence of <ν − 1, i> with the closed term given by the environment ...by ...

13

Call-by-Value Lambda-calculus and LJQ

Call-by-Value Lambda-calculus and LJQ

... sequent calculus for intuitionistic logic, with a simple re- striction on the first premiss of the usual left introduction rule for ...in lambda calculus, establishing a ...

25

Functional RuleML: From Horn Logic with Equality to Lambda Calculus

Functional RuleML: From Horn Logic with Equality to Lambda Calculus

... only the two most important values are specified for the val attribute (similarly, only two ord values are ...given). The DTD also does not enforce context-dependent attribute values such as ...

12

On the discriminating power of tests in resource lambda-calculus

On the discriminating power of tests in resource lambda-calculus

... 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 and M ∞ ...our calculus as an exception mechanism. With on ...

11

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 ...improving the machinery to guide and verify proofs, by means of improvements in the interaction with ...

135

Typechecking in the lambda-Pi-Calculus Modulo : Theory and Practice

Typechecking in the lambda-Pi-Calculus Modulo : Theory and Practice

... in the confluence of rewriting ...from the combination of rewrite rules with β- ...of the λΠ- Calculus Modulo for several ...is the most direct way to prove the product ...

169

Understanding untyped $\overline{\lambda}\mu\widetilde{\mu}$ calculus

Understanding untyped $\overline{\lambda}\mu\widetilde{\mu}$ calculus

... Although the original λµe µ calculus of [ 2 ] has a system of simple types based on the sequent calculus, the untyped version is a Turing-complete language for computation with ...

16

ASMs and Operational Algorithmic Completeness of Lambda Calculus

ASMs and Operational Algorithmic Completeness of Lambda Calculus

... Tailoring Lambda Calculus for an ASM Let F be the family of interpretations of all static symbols in the initial ...state. The adequate Lambda calculus to encode ...

38

A lambda-calculus foundation for universal probabilistic programming

A lambda-calculus foundation for universal probabilistic programming

... Kozen (1979) gives a semantics of imperative probabilistic pro- grams as partial measurable functions from infinite random traces to final states, which serves as the model for our trace semantics. Kozen also ...

15

Strong normalization of lambda-bar-mu-mu-tilde-calculus with explicit substitutions

Strong normalization of lambda-bar-mu-mu-tilde-calculus with explicit substitutions

... that the ~ x- al ulus is strongly ...hnique, with some adjustments, to prove SN of the - al ulus (introdu ed in [3℄) for the rst time, as far as we ...for the - al ulus [1℄, for ...

16

Spinal Atomic Lambda-Calculus

Spinal Atomic Lambda-Calculus

... for the example λx.λy. ((λz.z)y)x. The scope of the abstraction λx is the entire subterm, ...that with explicit substitution, the scope may grow or shrink by lifting explicit ...

21

Full abstraction for the quantum lambda-calculus

Full abstraction for the quantum lambda-calculus

... beyond the sequential deterministic case, there was for a long time no adequate notion of innocence [ Harmer and McCusker 1999 ...ago, with two notions of non-deterministic innocent strategies (using ...

29

The structural lambda-calculus

The structural lambda-calculus

... introduced the structural λj-calculus, a concise but expressive λ-calculus with ...of the well-known notions of full developments and L-developments, and to obtain the new, more ...

43

Non-idempotent typing operators, beyond the lambda-calculus

Non-idempotent typing operators, beyond the lambda-calculus

... in the introduction of Part II. Indeed, the non-idempotent approach provides very simple combinatorial arguments, only based on a decreasing measure, to characterize head or strongly normalizing terms by ...

370

Show all 10000 documents...