• Aucun résultat trouvé

[PDF] Top 20 Extending type theory with syntactic models

Has 10000 "Extending type theory with syntactic models" found on our website. Below are the top 20 most common "Extending type theory with syntactic models".

Extending type theory with syntactic models

Extending type theory with syntactic models

... Interval Type Theory, the type theory designed by Orton and Pitts [ OP17 ] and intended to be an internal language for the CCHM model of Cubical Type ...Löf Type Theory ... Voir le document complet

141

Extending Type Theory with Forcing

Extending Type Theory with Forcing

... of type P . E. Extending the forcing layer with new constructors To extend the logical power of the type theory of a forcing layer, we follow a general ... Voir le document complet

11

Epistemic logic meets epistemic game theory: a comparison between multi-agent Kripke models and type spaces

Epistemic logic meets epistemic game theory: a comparison between multi-agent Kripke models and type spaces

... deal with situations of interactive epistemology: Kripke models and type ...Econ Theory 106:356–391, 2002 ; Klein and Pacuit in Stud Log 102:297–319, 2014 ; Lorini in J Philos Log 42(6):863– ... Voir le document complet

32

The next 700 syntactical models of type theory

The next 700 syntactical models of type theory

... dependent type theory have been widely studied from a set theoretic point of view (see (Hoffman 1997) for a gen- eral overview), giving rise to several families of models, ...categories with ... Voir le document complet

14

The Taming of the Rew: A Type Theory with Computational Assumptions

The Taming of the Rew: A Type Theory with Computational Assumptions

... computation with non-well-typed terms can be semantically justified, there is in particular no need for a syntactic notion of subject reduction in our ...the theory under consideration. This means ... Voir le document complet

30

CoqMTU: a higher-order type theory with a predicative hierarchy of universes parametrized by a decidable first-order theory

CoqMTU: a higher-order type theory with a predicative hierarchy of universes parametrized by a decidable first-order theory

... This research is sponsored by NSFC Program (No.91018015) and 973 Program (No.2010CB328003) of China 1 Trusted Labs has developed in Coq a formal model of a Java Card platform (including a virtual machine, a byte-code ... Voir le document complet

10

A Reasonably Exceptional Type Theory

A Reasonably Exceptional Type Theory

... RETT syntactic model supports it, for simplicity the system featured in this paper does not feature ...applications with the layer in which the type of their argument lives, but we will often omit ... Voir le document complet

30

Kinetic Theory Models

Kinetic Theory Models

... Defining the viscosity µ = K b T ρτ, and considering P = P (0) + P (1) into Eq. (4.23) the Navier-Stokes equation is obtained. 4.2.2 The Lattice Boltzmann Method – LBM The use of the LBM provides many of the advantages ... Voir le document complet

58

Kinetic Theory Models

Kinetic Theory Models

... tanglements with neighboring ...for extending it in other directions, and (ii) by the fluctuation induced by the motions of the neighbor chains defining the tube lateral ... Voir le document complet

58

Epistemic logic meets epistemic game theory: a comparison between multi-agent Kripke models and type spaces

Epistemic logic meets epistemic game theory: a comparison between multi-agent Kripke models and type spaces

... complete with respect to the class of type spaces based on some modifications of Aumann’s system (Aumann ...language with probabilistic ...of type spaces, that he names type-space ... Voir le document complet

33

Eliminating Reflection from Type Theory

Eliminating Reflection from Type Theory

... T with UIP and functional ...T with UIP and functional extensionality and other axioms (mainly due to technical ...a syntactic translation, his work does not stress any constructive aspect of the ... Voir le document complet

20

A Syntactic Possibilistic Belief Change Operator: Theory and empirical study

A Syntactic Possibilistic Belief Change Operator: Theory and empirical study

... dealing with uncertainty. By using probabilistic-based models which are suit- able when information about past experiences is avail- able, and by using possibilistic-based models which in their turn ... Voir le document complet

17

Normalisation & Equivalence in Proof Theory & Type Theory

Normalisation & Equivalence in Proof Theory & Type Theory

... a syntactic category of their own: in that case, rule VarK can be read with y standing for a meta-variable of that variable category (otherwise it could stand for a term and then we have the rule of garbage ... Voir le document complet

377

Extending the C-K design theory to provide theoretical background for personal design agents

Extending the C-K design theory to provide theoretical background for personal design agents

... C-K theory suggests four types of operators for modelling the elaboration of ...dwellings with wheels are ...themselves with operations of the type C → C (a tent is a mobile ... Voir le document complet

8

Extending the C-K design theory: a theoretical background for personal design assistants

Extending the C-K design theory: a theoretical background for personal design assistants

... Computational models for design agents compatible with the C\K\E framework can be exploited to build personal design ...cooperate with the designer by observing the external design representation on ... Voir le document complet

25

Setoid type theory - a syntactic translation

Setoid type theory - a syntactic translation

... Keywords: type theory · function extensionality · proof irrelevance · univalence 1 Introduction Extensional type theory (ETT [23]) is a convenient setting for formalising math- ematics: ... Voir le document complet

42

Context-dependent type-level models for unsupervised morpho-syntactic induction

Context-dependent type-level models for unsupervised morpho-syntactic induction

... Since the word class models have been formulated by Brown et al. [13] and Clark [20], the effectiveness of using one-type-per-word representation for unsupervised POS induction is also simultaneously ... Voir le document complet

141

Non-classical expected utility theory with application to type indeterminacy

Non-classical expected utility theory with application to type indeterminacy

... two models calls for selecting the P ...both models the optimal strategy includes selecting the P D as a first mea- surement and, if the outcome is C, to repeat the choice of the P D two more ...both ... Voir le document complet

28

Extending Feature Models with Relative Cardinalities

Extending Feature Models with Relative Cardinalities

... feature models To automatically verify if a configuration conforms to a feature model, we also translate it into a constraint satisfaction problem and use the Choco Solver 1 ...[17], extending it to deal ... Voir le document complet

25

Data Category Registry: Morpho-syntactic and Syntactic Profiles

Data Category Registry: Morpho-syntactic and Syntactic Profiles

... populated with numerous data categories, but different users (including ourselves) asked for an upgrade with improved interface features and fully developed ... Voir le document complet

10

Show all 10000 documents...