Results 11 to 20 of about 22,638,529 (319)

Algebras of acyclic cluster type: Tree type and type à [PDF]

open access: yesNagoya Mathematical Journal, 2013
AbstractIn this paper, we study algebras of global dimension at most 2 whose generalized cluster category is equivalent to the cluster category of an acyclic quiver which is either a tree or of typeÃ.We are particularly interested in their derived equivalence classification.
Amiot, Claire, Oppermann, Steffen
openaire   +7 more sources

Honesty by Typing [PDF]

open access: yesLogical Methods in Computer Science, 2013
We propose a type system for a calculus of contracting processes. Processes can establish sessions by stipulating contracts, and then can interact either by keeping the promises made, or not. Type safety guarantees that a typeable process is honest - that is, it abides by the contracts it has stipulated in all possible contexts, even in presence of ...
Bartoletti, Massimo   +3 more
openaire   +14 more sources

Type-Indexed Data Types

open access: yesScience of Computer Programming, 2002
AbstractA polytypic function is a function that can be instantiated on many data types to obtain data type specific functionality. Examples of polytypic functions are the functions that can be derived in Haskell, such as show, read, and ‘==’. More advanced examples are functions for digital searching, pattern matching, unification, rewriting, and ...
Hinze, R, Jeuring, J, Löh, A
openaire   +10 more sources

Type Inference for Correspondence Types [PDF]

open access: yesElectronic Notes in Theoretical Computer Science, 2009
AbstractWe present a correspondence type/effect system for authenticity in a π-calculus with polarized channels, dependent pair types and effect terms and show how one may, given a process P and an a priori type environment E, generate constraints that are formulae in the Alternating Least Fixed-Point (ALFP) logic.
Gordon, Andrew D.   +2 more
openaire   +2 more sources

Topologies on Types [PDF]

open access: yesSSRN Electronic Journal, 2005
We define and analyze strategic topologies on types, under which two types are close if their strategic behavior will be similar in all strategic situations. To operationalize this idea, we adopt interim rationalizability as our solution concept, and define a metric topology on types in the Harsanyi-Mertens-Zamir universal type space.
Stephen Morris   +3 more
openaire   +7 more sources

A Type-Directed Negation Elimination [PDF]

open access: yes, 2015
In the modal mu-calculus, a formula is well-formed if each recursive variable occurs underneath an even number of negations. By means of De Morgan's laws, it is easy to transform any well-formed formula into an equivalent formula without negations -- its
Lozes, Etienne
core   +6 more sources

A Note on Supersymmetric Type II Solutions of Lifshitz Type [PDF]

open access: yes, 2012
We discuss a class of supersymmetric type II non-relativistic solutions with exact or asymptotic scale invariance. As already emerged from previous investigations, we find a clear correspondence between anisotropic d-dimensional vacua and relativistic ...
A Butti   +33 more
core   +2 more sources

Session Types = Intersection Types + Union Types [PDF]

open access: yesElectronic Proceedings in Theoretical Computer Science, 2011
In Proceedings ITRS 2010, arXiv:1101 ...
openaire   +5 more sources

The basics of development of support reactions in an early ontogenesis

open access: yesНауковий Вісник Південноукраїнського Національного Педагогічного Університету імені К. Д. Ушинського, 2020
On account of the current situation of total deterioration in the children’s health in Ukraine, a special focus is to be paid to the issues related to the children who suffer from the disorders of the musculoskeletal system, where the verticalisation of ...
Biesieda Volodymyr, Marchuk Vitaliy
doaj   +1 more source

The geometry of types [PDF]

open access: yesProceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages, 2013
We show that time complexity analysis of higher-order functional programs can be effectively reduced to an arguably simpler (although computationally equivalent) verification problem, namely checking first-order inequalities for validity. This is done by giving an efficient inference algorithm for linear dependent types which, given a PCF term ...
DAL LAGO, UGO, Barbara Petit
openaire   +4 more sources

Home - About - Disclaimer - Privacy