[PDF] Top 20 On type-based termination and dependent pattern matching in the calculus of inductive constructions
Has 10000 "On type-based termination and dependent pattern matching in the calculus of inductive constructions" found on our website. Below are the top 20 most common "On type-based termination and dependent pattern matching in the calculus of inductive constructions".
On type-based termination and dependent pattern matching in the calculus of inductive constructions
... assistants based on dependent type theory are gaining attention in recent years, not only as a tool for developing formal mathematical proofs, but also as a tool for developing certified ... Voir le document complet
165
Extending the Calculus of Constructions with Tarski's fix-point theorem
... useless pattern-matching constructs that are added in the code to mirror the pattern-matching constructs that appear in the calculus of ... Voir le document complet
16
Gradualizing the Calculus of Inductive Constructions
... over-approximating in order to be sound (and actually imply N ), there are effectively-terminating programs with imprecise variants that yield termination contract ...date, the only related ... Voir le document complet
65
On the relation between sized-types based termination and semantic labelling
... Sized-types based termination We now present a simplified version of the termination criterion introduced in [5], where the first author considers rewrite systems on terms ... Voir le document complet
20
Decidable Type Inference for the Polymorphic Rewriting Calculus
... RhoF in order to obtain a corresponding type inference system ` a la ...Curry. In Rho|F|, the calculus ` a la Curry, type information is not given in the term, ... Voir le document complet
18
Ditransitive constructions in Purepecha: a hybrid type
... 3 The girl went. Purepecha is a nominative-accusative language in which the subject of a transitive verb, like selia 'Celia' in (2a), is encoded similarly to the subject ... Voir le document complet
25
A Reflexive and Automated Approach to Syntactic Pattern Matching in Code Transformations
... ease the burden by having a common representation for (almost) all ...languages. The concepts in the metamodel corresponds to core nodes available in most programming languages, such as ... Voir le document complet
12
On Computational Interpretations of the Modal Logic S4 IIIb. Confluence, Termination of the $\lambda\mbox{ev}Q_H$-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
55
Unsolvability of the Quintic Formalized in Dependent Type Theory
... { in root (p ^^ ratr), ∀ x, ∃ f : algterm rat, algR_eval ratr f = ...reasoning in a constructive setting 8.1 Boolean reflection and effective Galois theory The present contribution takes over ... Voir le document complet
19
BlastGraph: intensive approximate pattern matching in string graphs and de-Bruijn graphs
... to the number of queries. Note that reported time do not include the indexation time equal to 22 seconds independently of the number of ...queries. the algorithm, for ... Voir le document complet
14
Pattern Matching in discrete Models for Ecosystem Ecology
... concept of similarity will be the basis of our ...discussed in theory (see for instance the philosophical work in (Tversky, 1977)) and also used in practice: ... Voir le document complet
12
Online Timed Pattern Matching using Automata
... refine the patterns, for example the expression p ∩ (true · hqi [a,∞] · true) considers only q-bursts that last for at least a ...time. The problem of timed pattern matching has ... Voir le document complet
18
Log analysis via space-time pattern matching
... from pattern matching and able to find alarm correlations with or without prior knowledge about the monitored ...system. The data structure can store every observed pattern ... Voir le document complet
6
Constructions and In-Place Operations for MDDs Based Constraints
... extends in three ways our previous work about efficient operations on Multi-valued Decision Diagrams (MDD) for building Constraint Programming ...improve the existing methods for transforming a set ... Voir le document complet
16
Toward dependent choice: a classical sequent calculus with dependent types
... Whereas the stream is, at level of formulæ, an inhabitant of a coinductive defined infinite conjunction ν 0 Xn (∃P(0, y) ∧ X(n + 1)), we cannot afford to pre-evaluate each of its components, ... Voir le document complet
3
A type system for embedded rewriting languages with associative pattern matching: from theory to practice
... Γ(γ) the fact that a pair γ belongs to Γ . The context has at most one declaration of type per variable and of rank per operator since operator overloading is ...forbidden. ... Voir le document complet
21
Type Inference for the receptive distributed Pi-calculus
... The type system we used is a simplified version of the simple type system of [HR98]; that is we use location types : : that records the names and types that may be used to communicate[r] ... Voir le document complet
34
Implicit Polymorphic Type System for the Blue Calculus
... Unité de recherche INRIA Lorraine, Technopôle de Nancy-Brabois, Campus scientifique, 615 rue du Jardin Botanique, BP 101, 54600 VILLERS LÈS NANCY Unité de recherche INRIA Rennes, Irisa, [r] ... Voir le document complet
35
Optimizing pattern matching compilation by program transformation
... ensure the termination. The IfSwapping rule is the only rule that does not decrease the size or the number of assignments of a ...implemented in two ways, ... Voir le document complet
20
Two Techniques for Compiling Lazy Pattern Matching
... 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
40
Sujets connexes