• Aucun résultat trouvé

[PDF] Top 20 Encoding dependent types in an intuitionistic logic

Has 10000 "Encoding dependent types in an intuitionistic logic" found on our website. Below are the top 20 most common "Encoding dependent types in an intuitionistic logic".

Encoding dependent types in an intuitionistic logic

Encoding dependent types in an intuitionistic logic

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

35

Quantitative Types for Intuitionistic Calculi

Quantitative Types for Intuitionistic Calculi

... by intuitionistic logic, in both natural deduction and sequent calculus ...language in natural deduction style is the linear substitution calculus [3], called here M-calculus, and obtained ... Voir le document complet

47

A Classical Sequent Calculus with Dependent Types

A Classical Sequent Calculus with Dependent Types

... imply, in an intuitionistic framework, all the other forms of classical reasoning (excluded middle, reductio ad absurdum, double negation elimination, ... Voir le document complet

49

Encoding TLA+ into unsorted and many-sorted first-order logic

Encoding TLA+ into unsorted and many-sorted first-order logic

... whereas an untyped language like TLA + is very expressive and flexible for writing speci- fications, automated reasoners rely on types for good automation, either inter- nally [37] or explicitly, as ... Voir le document complet

32

A Classical Sequent Calculus with Dependent Types

A Classical Sequent Calculus with Dependent Types

... Nevertheless, dependent types are known to misbehave in the presence of control operators, causing a degeneracy of the domain of discourse ...the dependent types are thus necessary to ... Voir le document complet

43

A Decidable Subtyping Logic for Intersection and Union Types

A Decidable Subtyping Logic for Intersection and Union Types

... intersection types, as the Λ ∩∪ t6 calculus and the proof-functional logic L ∩∪ 6 ...features an experimen- tal implementation of dependent-types `a la LF following the above type ... Voir le document complet

16

Combining union, intersection and dependent types in an explicitely typed lambda-calculus

Combining union, intersection and dependent types in an explicitely typed lambda-calculus

... types in an explicitely typed lambda-calculus Abstract: The subject of this thesis is about lambda-calculus decorated with types, usually called “Church-style typed ...Intersection ... Voir le document complet

148

Translating types and effects with state monads and linear logic

Translating types and effects with state monads and linear logic

... study types and effects from the logical point of view, and stratification together with ...linear logic (LL [ 7 ]=, which has already been employed in the study of ...notions in LL’s toolbox ... Voir le document complet

15

Cones as a model of intuitionistic linear logic

Cones as a model of intuitionistic linear logic

... data types such as the real line, we introduced with Pagani and Tasson a model of probabilistic higher or- der computation based on (positive) cones, and a class of to- tally monotone functions that we called ... Voir le document complet

20

An affine-intuitionistic system of types and effects: confluence and termination

An affine-intuitionistic system of types and effects: confluence and termination

... between intuitionistic proofs and typed func- tional programs that goes under the name of Curry-Howard ...linear logic [9], this correspondence has been re- fined to include an explicit treatment of ... Voir le document complet

35

A Classical Sequent Calculus with Dependent Types

A Classical Sequent Calculus with Dependent Types

... imply, in an intuitionistic framework, all the other forms of classical reasoning (excluded middle, reductio ad absurdum, double negation elimination, ... Voir le document complet

50

An order-dependent transfer model in categorization

An order-dependent transfer model in categorization

... defined in OGCM, depending on its versions. We consider a simple case in which the learning phase is composed of three blocks and the transfer phase of one ...stimuli. In OGCM-A, OGCM-F, and OGCM-M, ... Voir le document complet

37

A Constructive Proof of Dependent Choice, Compatible with Classical Logic

A Constructive Proof of Dependent Choice, Compatible with Classical Logic

... (Martin-Löf’s dependent sum type) so that it becomes compatible with classical reasoning in a computationally sound ...way. In this restricted framework, we lose the full axiom of choice but keep the ... Voir le document complet

11

Combining Linear Logic and Size Types for Implicit Complexity

Combining Linear Logic and Size Types for Implicit Complexity

... linear logic and defines type systems based on restricted versions of the ”!” modality controlling ...duplication. An instance of this is light linear logic for polynomial time computation ...linear ... Voir le document complet

37

Compression of underwater video sequences with quantizer/position-dependent encoding

Compression of underwater video sequences with quantizer/position-dependent encoding

... The performance of a particular grouping of the starting positions and the quantizers is assessed by encoding a test sequence with the corresponding set of quantizer/p[r] ... Voir le document complet

65

Business and logic charateristic in an collaborative situation

Business and logic charateristic in an collaborative situation

... you in my life. THANK all the people in EMAC, Dolores, Denis, Anne-Marie, Nicolas, Elise, Guillaume, Aurelian, Olfa, François, Sarah… and all I did not ...you. In Chinese: ... Voir le document complet

211

An Approach to Abductive Reasoning in Equational Logic

An Approach to Abductive Reasoning in Equational Logic

... shown in the graphs of Figure ...smaller in equational logic than in propositional ...propositional logic and the many instances of equivalent clauses that cannot be detected in ... Voir le document complet

8

Normalization by evaluation for sized dependent types

Normalization by evaluation for sized dependent types

... is dependent on the value of n, thus cannot be determined ...equality in powerful type theories with non-trivial ...singleton types or proof irrelevance [ Abel et ... Voir le document complet

31

Implementing HOL in an Higher Order Logic Programming Language

Implementing HOL in an Higher Order Logic Programming Language

... implement in user space a second programming language, exposed to the user to write tactics, that takes care of binding, metavariables, back- tracking and its ...written in multiple languages and ... Voir le document complet

11

Directional types for logic programs and the annotation method

Directional types for logic programs and the annotation method

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

Show all 10000 documents...