Results 11 to 20 of about 4,460 (258)
Free Applicative Functors [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 Applicative functors are a generalisation of monads. Both allow the expression of effectful computations into an otherwise pure language, like Haskell.
Paolo Capriotti, Ambrus Kaposi
doaj +1 more source
CUTTINGS AND APPLICATIONS [PDF]
International Journal of Computational Geometry & Applications, 1995 We prove a general lemma on the existence of (1/r)-cuttings of geometric objects in Ed that satisfy certain properties. We use this lemma to construct (1/r)-cuttings of small size for arrangements of line segments in the plane and arrangements of triangles in 3-space; for line segments in the plane we obtain a cutting of size O(r+Ar2/n2), and for ...
DEBERG, M +1 more
openaire +3 more sources
Applications of Nanofluids [PDF]
Nanomaterials, 2021 Nanofluids as a combination of base fluid and a low concentration of nano-sized particles of metal or metal oxides are used in different fields of human activity, including engineering devices in power and chemical engineering, medicine, electronics, and others [...]
openaire +4 more sources
Review of Bantu applicative constructions
Studies in African Linguistics, 2020 This is a review of Bantu applicative constructions by Sara Pacchiarotti. CSLI Publications, Stanford California.
Brent Henderson
doaj +3 more sources
Raising applicatives and possessors in Tagalog
Glossa, 2019 This paper argues that the thematic introduction of applied arguments and their syntactic licensing are independent components in the syntax of applicative constructions in Tagalog.
Yining Nie
doaj +2 more sources
Resonance Raman and Multivariate Curve Resolution-Alternating Least Squares (MCR-ALS) Analysis of Biological Polyenes in Shells: A Nondestructive Approach for Species and Habitat Identification [PDF]
ACS OmegaKohei Tamura +5 more
doaj +2 more sources
Zaps and their applications [PDF]
Proceedings 41st Annual Symposium on Foundations of Computer Science, 2002 A zap is a 2-round, public coin witness-indistinguishable protocol in which the first round, consisting of a message from the verifier to the prover, can be fixed “once and for all” and applied to any instance. We present a zap for every language in NP, based on the existence of noninteractive zero-knowledge proofs in the shared random string model ...
Cynthia Dwork, Moni Naor
openaire +2 more sources
Structure removal: An argument for feature-driven Merge
Glossa, 2017 Assuming that it needs to be decided at some point whether a given Merge(α,β) operation is legitimate, there are two basic options. The first possibility is that one of the two categories is equipped with an intrinsic formal property (typically encoded ...
Gereon Müller
doaj +2 more sources
Isogloss, 2023 In this study, we propose a comparative analysis of the ditransitive constructions in Dialectal Brazilian Portuguese (DBP) and Colloquial Standard Brazilian Portuguese (BP), taking into consideration the phenomenon named Double Pronominalization, in ...
Heloisa Salles +1 more
doaj +1 more source
Confixal word-formation rows with the suffix -ment [PDF]
Ostrava Journal of English Philology, 2022 This article presents a detailed analysis of the structure of five confixal word-formation rows with the suffix -ment from the synchronous point of view and with the help of the applicative generative model.
Olena Dotsenko
doaj +1 more source