Results 31 to 40 of about 1,087,555 (135)
Topology is relevant (in a dichotomy conjecture for infinite-domain constraint satisfaction problems) [PDF]
34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS
2019), 2019 The algebraic dichotomy conjecture for Constraint Satisfaction Problems (CSPs) of reducts of (infinite) finitely bounded homogeneous structures states that such CSPs are polynomial-time tractable when the model-complete core of the template has a pseudo-Siggers polymorphism, and NP-complete otherwise.
arxiv +1 more source
Self-assembling of multilayered polymorphs with ion beams [PDF]
Nano Lett. 25 (2025) 1637-1643Polymorphism contributes to the diversity of nature, so that even materials having identical chemical compositions exhibit variations in properties because of different lattice symmetries. Thus, if stacked together into multilayers, polymorphs may work as an alternative approach to the sequential deposition of layers with different chemical ...
arxiv +1 more source
Filter Models: Non-idempotent Intersection Types, Orthogonality and Polymorphism
Annual Conference for Computer Science Logic, 2011 This paper revisits models of typed lambda calculus based on filters of intersection types: By using non-idempotent intersections, we simplify a methodology that produces modular proofs of strong normalisation based on filter models.
A. Bernadet, Stéphane Lengrand
semanticscholar +1 more source
What's Decidable about (Atomic) Polymorphism [PDF]
arXiv, 2021 Due to the undecidability of most type-related properties of System F like type inhabitation or type checking, restricted polymorphic systems have been widely investigated (the most well-known being ML-polymorphism). In this paper we investigate System Fat, or atomic System F, a very weak predicative fragment of System F whose typable terms coincide ...
arxiv
The Power of the Combined Basic LP and Affine Relaxation for Promise CSPs [PDF]
SIAM Journal on Computing 49(6) (2020) 1232-1248, 2019 In the field of constraint satisfaction problems (CSP), promise CSPs are an exciting new direction of study. In a promise CSP, each constraint comes in two forms: "strict" and "weak," and in the associated decision problem one must distinguish between being able to satisfy all the strict constraints versus not being able to satisfy all the weak ...
arxiv +1 more source
The game of set®: an ideal example for introducing polymorphism and design patterns
Technical Symposium on Computer Science Education, 2004 This paper presents an object--oriented design for a solitaire version of the game of Set® The design is responsibility driven and illustrates polymorphism and several fundamental design patterns, including Flyweight, Strategy and Factory.
Stuart A. Hansen
semanticscholar +1 more source
Tulīd va Farāvarī-i Maḥṣūlāt-i Zirā̒ī va Bāghī, 2008 Genetic maps with high genome coverage are becoming increasingly useful in both basic and applied genetic researches. In the last decades, the advent of DNA markers has brought about a magnificent revolution in the production of genetic map, especially ...
M. Rahimmalek +2 more
doaj
Design Methods for Polymorphic Combinational Logic Circuits based on the Bi_Decomposition Approach [PDF]
arXiv, 2017 Polymorphic circuits are a special kind of digital logic components, which possess multiple build-in functions. In different environments, a polymorphic circuit would perform different functions. Evolutionary Algorithms, Binary Decision Diagrams (BDD) and the multiplex method have been adopted to design polymorphic circuits.
arxiv
Subtyping on Nested Polymorphic Session Types [PDF]
arXiv, 2021 The importance of subtyping to enable a wider range of well-typed programs is undeniable. However, the interaction between subtyping, recursion, and polymorphism is not completely understood yet. In this work, we explore subtyping in a system of nested, recursive, and polymorphic types with a coinductive interpretation, and we prove that this problem ...
arxiv
ReLoC: A Mechanised Relational Logic for Fine-Grained Concurrency
Logic in Computer Science, 2018 We present ReLoC: a logic for proving refinements of programs in a language with higher-order state, fine-grained concurrency, polymorphism and recursive types.
D. Frumin, Robbert Krebbers, L. Birkedal
semanticscholar +1 more source