Encoding FIX in Object Calculi

Roy L. Crole

Displaying similar documents to “Encoding FIX in Object Calculi”

Easy lambda-terms are not always simple

Alberto Carraro, Antonino Salibra (2012)

RAIRO - Theoretical Informatics and Applications

Similarity:

A closed -term is if, for any other closed term , the lambda theory generated by = is consistent. Recently, it has been introduced a general technique to prove the easiness of -terms through the semantical notion of simple easiness. Simple easiness implies easiness and allows to prove consistency results construction of suitable filter models of -calculus living in the category of complete partial orderings: given ...

Easy lambda-terms are not always simple

Alberto Carraro, Antonino Salibra (2012)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Similarity:

Equality sets for recursively enumerable languages

Vesa Halava, Tero Harju, Hendrik Jan Hoogeboom, Michel Latteux (2010)

RAIRO - Theoretical Informatics and Applications

Similarity:

We consider shifted equality sets of the form , where and are nonerasing morphisms and is a letter. We are interested in the family consisting of the languages , where is a coding and is a shifted equality set. We prove several closure properties for this family. Moreover, we show that every recursively enumerable language is a projection of a shifted equality set, that is, for some (nonerasing) morphisms and and...

Denotational aspects of untyped normalization by evaluation

Andrzej Filinski, Henning Korsholm Rohde (2010)

RAIRO - Theoretical Informatics and Applications

Similarity:

We show that the standard normalization-by-evaluation construction for the simply-typed -calculus has a natural counterpart for the untyped -calculus, with the central type-indexed logical relation replaced by a “recursively defined” , in the style of Pitts. In fact, the construction can be seen as generalizing a computational-adequacy argument for an untyped, call-by-name language to normalization instead of evaluation.In the untyped setting, not all terms have normal forms,...

Pointwise constrained radially increasing minimizers in the quasi-scalar calculus of variations

Luís Balsa Bicho, António Ornelas (2014)

ESAIM: Control, Optimisation and Calculus of Variations

Similarity:

We prove of vector minimizers () = (||) to multiple integrals ∫ ((), |()|) on a ⊂ ℝ, among the Sobolev functions (·) in + (, ℝ), using a : ℝ×ℝ → [0,∞] with (·) and . Besides such basic hypotheses, (·,·) is assumed to satisfy also...

Hydrodynamic limit of a d-dimensional exclusion process with conductances

Fábio Júlio Valentim (2012)

Annales de l'I.H.P. Probabilités et statistiques

Similarity:

Fix a polynomial of the form () = + ∑2≤≤ =1 with (1) gt; 0. We prove that the evolution, on the diffusive scale, of the empirical density of exclusion processes on $𝕋^{d}$ , with conductances given by special class of functions, is described by the unique weak solution of the non-linear parabolic partial differential equation = ∑ ...

Hereditary properties of words

József Balogh, Béla Bollobás (2010)

RAIRO - Theoretical Informatics and Applications

Similarity:

Let be a hereditary property of words, , an infinite class of finite words such that every subword (block) of a word belonging to is also in . Extending the classical Morse-Hedlund theorem, we show that either contains at least words of length for every or, for some , it contains at most words of length for every . More importantly, we prove the following quantitative extension of this result: if has words of length then, for every , it contains at most ⌈( + 1)/2⌉⌈( + 1)/2⌈...

Computing and proving with pivots

Frédéric Meunier (2013)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

A simple idea used in many combinatorial algorithms is the idea of . Originally, it comes from the method proposed by Gauss in the 19th century for solving systems of linear equations. This method had been extended in 1947 by Dantzig for the famous simplex algorithm used for solving linear programs. From since, a pivoting algorithm is a method exploring subsets of a ground set and going from one subset to a new one ′ by deleting an element inside and adding an element outside : ′ = ...