[PDF] Top 20 Gradualizing the Calculus of Inductive Constructions
Has 10000 "Gradualizing the Calculus of Inductive Constructions" found on our website. Below are the top 20 most common "Gradualizing the Calculus of Inductive Constructions".
Gradualizing the Calculus of Inductive Constructions
... date, the only related work that considers the gradualization of full dependent types with ? as both a term and a type, is the work on GDTL [ Eremondi et ...between the typing and ... Voir le document complet
65
On type-based termination and dependent pattern matching in the calculus of inductive constructions
... property of proof assistants as functional programming languages is that the computation (evaluation) of well-typed programs always terminate (this property is called strong ...Termination of ... Voir le document complet
165
Complete Bidirectional Typing for the Calculus of Inductive Constructions
... all of these consider unannotated λ-abstractions, and use bidirectional typing as a way to remedy this lack of ...lightness of the input syntax, but poses an inherent completeness problem, as ... Voir le document complet
20
Extending the Calculus of Constructions with Tarski's fix-point theorem
... to the logical framework, three cases may occur: first, the new axioms may make the system inconsistent; second, the new axioms may be used only in the part of the models ... Voir le document complet
16
Classical program extraction in the calculus of constructions
... from the early development of the calculus of constructions (CC) [3] to its more recent extensions [12, 16] im- plemented in proof assistants such as Coq [17], LEGO or ... Voir le document complet
17
The development of mirative no wonder-constructions
... from the hypothesis that the clausal and adverbial expressions resulted from largely distinct paths, with the adverbials not necessarily deriving via ellipsis from the clausal ...for ... Voir le document complet
2
The syntax of copular constructions in Mauritian
... (38) the more intelligent the students (are), the better the marks ...these constructions where copula omission is possible if and only if its complement is fronted as in (36), ... Voir le document complet
21
Remarks on isomorphisms of simple inductive types
... iativity of produ t) are no more viewed as omputational and their use may require additional and heavy proof ...development. The arguments in favor of the equality based only on -redu tion ... Voir le document complet
20
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
... 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
Statistical aspects of the fractional stochastic calculus
... to the case = 1 here. The hypotheses of the above proposition imply that b is ...monotone. The proof of Proposition 2 requires a criterion from the Malliavin ... Voir le document complet
55
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
Calculation of the Fire Resistance of Steel Constructions
... L’accès à ce site Web et l’utilisation de son contenu sont assujettis aux conditions présentées dans le site LISEZ CES CONDITIONS ATTENTIVEMENT AVANT D’UTILISER CE SITE WEB. Technical Translation (National Research ... Voir le document complet
40
On the Development of Analytic Constructions in Purepecha
... 'competition' of the in order to encode the same ...analyze the development of analytic constmctions Purepecha using verbs: 'be thcre', and xinte, 'be', as auxilianes and ...Purepecha, ... Voir le document complet
20
The ∆-calculus: Syntax and Types
... present the ∆-calculus, an explicitly typed λ-calculus with strong pairs, projections and explicit type ...coercions. The calculus can be parametrized with different intersection type ... Voir le document complet
30
On the poset of computation rules for nonassociative calculus
... where the intuitive idea of a computation rule is made precise, and show that our formalization fulfills our initial ...is the neutral element of 6, we deal with sequences (words) built on Z = ... Voir le document complet
21
Fully Abstract Models of the Probabilistic λ-calculus
... is the S-component of Π 1 x ∈ C(S k C), and likewise for (Π 2 x) T .... The resulting map τ ~ σ : T ~ S → A k B k C is not quite a probabilistic ∼-strategy, because σ and τ play on dual versions ... Voir le document complet
18
On the confluence of lambda-calculus with conditional rewriting
... rewriting. The semi-closure condition is sufficient to avoid this, and it seems to provide the counterpart of left-linearity for unconditional ...class of non semi-closed systems that can be ... Voir le document complet
44
The structural lambda-calculus
... The specification of all the reduction subsystems used in this section exploits the idea of ...Thus, the λj-calculus provides a uniform and expressive framework to reason ... Voir le document complet
43
Asynchrony and the Pi-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
20
Sujets connexes