Applicative can refer to Applicative programming language Applicative voice disambig Template Longcomment added to the page to prevent it being listed on Special Shortpages. ... more details
The applicative voice list of glossing abbreviations abbreviated sc apl or sc appl is a grammatical voice which promotes an oblique case oblique argument of a verb to the core Object grammar object argument, and indicates the oblique role within the meaning of the verb. When the applicative voice is applied to a verb, its valency linguistics valency may be increased by one. Applicatives are common in the world s languages, famously so in the case of the Bantu languages . English does not have a dedicated applicative prefix or suffix. However, prepositions can be compounded with verbs for an applicative effect. For example, from Jack ran faster than the giant , the intransitive verb ran can be made transitive, and the oblique noun giant the object Jack outran the giant. The applicative verb can be made passive voice passive , something which is not possible with ran The giant was outrun by Jack. Many languages, however, do have dedicated morphology linguistics morphology commonly several affixes , for applicative uses. For example, in Yagua language Yagua He blows into it may be expressed as saduu r viim , where saduu is blow with a third person subject, and r viim is an oblique meaning into an inanimate object. Expressed with an applicative it is saduu t ra , where ta is a locative case locative applicative and the locative oblique is no longer present. The verb indicates both the agent as before and adds an object through ra . Applicative constructions are found in various languages, particularly in highly agglutinative language s, such as Nux lk language Bella Coola Nux lk ... has an applicative suffix i or e which appears before the last vowel of the verb. From andika to write ... applicatives. Some languages, such as Luganda Ganda , permit a second applicative known ... applicative is used to give an alternative meaning. Applicatives may also be the only way of expressing ... role commonly expressed by means of an applicative References cite book first Mark last Aronoff ... more details
Applicative Universal Grammar , or AUG , is a universal semantic metalanguage intended for studying the linguistic semantics semantic processes in particular languages ref Sebastian Shaumyan Shaumyan S. A Semiotic Theory of Language . Bloomington and Indianapolis Indiana University Press, 1987 ref . This is a linguistics linguistic theory that views the formation of phrase in a form that is analogous to function application in an applicative programming language . See also Combinatory logic Lambda calculus Functional programming Applicative programming language Applicative computing systems References references Further reading Shaumyan S. Applicative grammar as a semantic theory of natural language . University of Chicago Press, 1977. Category Philosophy of language Category Formal methods Category Applicative computing systems ling stub ... more details
unreferenced date December 2011 In the programming paradigm classification of programming languages , an applicative programming language is designed to support the development of programs as giving the result of a function of the combined variables. Successive functional transformations are applied to data to arrive at the result. Such a programming language language , with program control and total state kept in the background, may also be known as a functional language , in a rather loose sense of the term. Lisp programming language Lisp and ML programming language ML are applicative programming languages. In Haskell programming language Haskell , this programming paradigm is developed into the applicative functor , which extends the higher order function al abstraction beyond Monad functional programming monad . See also Function level programming Applicative Universal Grammar External links http www.soi.city.ac.uk ross papers Applicative.html Applicative Programming with Effects in Haskell, 2008 by Conor McBride and Ross Paterson Category Programming language classification Category Applicative computing systems ru ... more details
Applicative computing systems , or ACS are the systems of object calculi founded on combinatory logic and lambda calculus ref Wolfengagen V.E. Methods and means for computations with objects. Applicative Computational Systems. M. JurInfoR Ltd., Center JurInfoR , 2004. xvi 789 pp. ISBN 5 89158 100 0. ref . The only essential notion which is under consideration in these systems is the representation of object computer science object . In combinatory logic the only metaoperator is function application application in a sense of applying one object to other. In lambda calculus two metaoperators are used function application application the same as in combinatory logic, and functional abstraction which binds the only variable in one object. Features of ACS The objects generated in these systems are the functional entities with the following features the number of argument places, or object arity is not fixed but is enabling step by step in interoperations with other objects in a process of generating the compound object one of its counterparts function, is applied to other one argument, but in other contexts they can change their roles, i.e. functions and arguments are considered on the equal rights the self applying of functions is allowed, i.e. any object can be applied to itself. ACS give a sound ground for applicative programming language applicative approach to programming. Research challenge Applicative computing systems lack of storage and history sensitivity is the basic reason they have not provided a foundation for computer design. Moreover, most applicative systems employ the substitution operation of the lambda calculus as their basic operation. This operation is one of virtually unlimited power, but its complete and efficient realization presents great difficulties ... Combinatory logic Lambda calculus Categorical abstract machine Functional programming Applicative ... 101 9. DEFAULTSORT Applicative Computing Systems Category Applicative computing systems Category Models ... more details
Unreferenced date December 2009 Orphan date February 2009 The Kent Applicative Operating System is a functional operating system concept to use dynamic process creation and inter process communication. The system is based on earlier work by Will R. Stoye . The system allow dynamic creation of functional process es. Processes are stream processors, functions that transform an ingoing to an outgoing stream. Process scheduling is based on evaluation on demand. Inter process communication is, by message passing , based on Stoye s sorting office concept. Category Discontinued operating systems Operating system stub ... more details
Unreferenced stub auto yes date December 2009 Dative shifting is a grammatical process by which an oblique case oblique argument of a verb , usually one functioning as a recipient or a Benefactive case benefactive roles often expressed by dative case datives , is placed in the same grammatical role as a Patient Grammar patient , increasing the valency linguistics valency of the verb and forming a clause with two objects. An example in English would be He gave a present to me versus He gave me a present , the latter being the dative shifted version. This is commonly done to emphasize the oblique, which would normally be of secondary importance. Dative shifting is similar to the Applicative voice applicative construction, though with two main differences The oblique roles are generally restricted to recipient or beneficiary as opposed to the other forms of obliques that may appear in applicatives there is also usually no marking on the verb, as opposed to applicatives which usually signal the construction through a morpheme added to the verb. See also Object grammar Dechticaetiative language DEFAULTSORT Dative Shift Category Grammar Ling stub ... more details
In grammar , a circumstantial voice , or circumstantial passive voice , is a grammatical voice voice that promotes an oblique case oblique argument of a verb to the role of subject grammar subject the underlying subject may then be expressed as an oblique argument. A given language may have several circumstantial voices, each promoting a different oblique argument. One very common circumstantial voice is the ordinary passive voice , which promotes a patient grammar patient to the subject position. Circumstantials are conceptually similar to applicative voice applicative s, which promote obliques to direct object s. However, applicatives may increase the valency linguistics valency of an intransitive verb by adding a direct object, while circumstantials cannot. Circumstantials are found in the Malagasy language . References cite book first R. L. last Trask year 1993 title A Dictionary of Grammatical Terms in Linguistics publisher Routledge isbn 0 415 08628 0 External links http literalminded.wordpress.com 2005 09 04 dougs circumstantial passive Doug s Circumstantial Passive ling stub Category Grammatical voices br Tu darvoudel it Diatesi circostanziale ... more details
Infobox programming language name SASL logo paradigm Functional programming functional year 1972 designer David Turner computer scientist David Turner developer latest release version latest release date latest test version latest test date typing implementations dialects influenced by ISWIM influenced Kent Recursive Calculator KRC , Miranda programming language Miranda , Haskell programming language Haskell operating system license website SASL from S t. A ndrews S tatic L anguage, alternatively S t. A ndrews S tandard L anguage is a purely functional programming functional programming language developed by David Turner computer scientist David Turner at the University of St Andrews in 1972, based on the applicative subset of ISWIM ref Turner, An implementation of SASL ref . In 1976 Turner redesigned and reimplemented it as a non strict lazy language ref Turner , A New Implementation Technique for Applicative Languages, pages 31 49 ref . In this form it was the foundation of Turner s later languages Kent Recursive Calculator KRC and Miranda programming language Miranda , but SASL appears to be untyped whereas Miranda has polymorphic types. Notes references References cite journal last Turner first D.A. title An Implementation of SASL journal University of St. Andrews, Department of Computer Science Technical Report volume TR 75 4 cite journal last Turner first D.A. title A New Implementation Technique for Applicative Languages journal Software Practice and Experience volume 9 year 1979 doi 10.1002 spe.4380090105 pages 31 See also ISWIM Category Functional languages compu lang stub ru SASL ... more details
A graph reduction machine is a special purpose computer built to perform combinator calculations by graph reduction . Examples include the SKIM S K I machine computer, built at the University of Cambridge Computer Laboratory , and the multiprocessor GRIP Graph Reduction In Parallel computer, built at University College London . Compu hardware stub References T. J. W. Clarke, P. Gladstone, C. MacLean, A. C. Norman SKIM The S, K, I Reduction Machine . LISP Conference, 1980 128 135 See also SECD machine External links http www fp.dcs.st and.ac.uk kh papers pasco94 subsubsectionstar3 2 1 1.html Category Applicative computing systems Category Functional programming Category University of Cambridge Computer Laboratory ... more details
Wiktionary aug Aug or AUG may refer to An abbreviation of August, the eighth month of the year in the Gregorian calendar Augusta State Airport in Augusta, Maine IATA Code AUG Steyr AUG , an Austrian series of firearms Start codon , the three nucleotide sequence that starts translation of mRNA, and codes for the amino acid Methionine Aztlan Underground , an activist rock en Espa ol and hip hop group Applicative Universal Grammar , a linguistic theory an augmented chord AUG is an abbreviation for the digital gold currency unit grams of gold, payable in e gold AU being the chemical symbol for gold, G representing grams Augusta Railroad , defunct List of Arkansas railroads Arkansas railroad The codon for the amino acid Methionine People Andrus Aug born 1972 , an Estonian road bicycle racer disambiguation de Aug es AUG eo AUG fr AUG it AUG lt AUG ja AUG ru sv Aug zh AUG ... more details
Slovenian National Corpus FidaPLUS is the biggest and the most important corpus of the Slovenian language . It is an upgrade of FIDA corpus, which was developed between 1997 and 2000, with added texts that were published up to 2006 . It was the result of the applicative research project of the Faculty of Arts, Faculty of Social Sciences, both University of Ljubljana , and Jo ef Stefan Institute s Department of Knowledge Technologies. ref http www.fidaplus.net Info Info main sodelavci eng.html The FidaPLUS team list and institutional affiliations ref It consists of 621 million words tokens gathered from selected texts written in Slovenian of different genres and styles, from books and newspapers mainly . ref http www.fidaplus.net Info Info main besedilodajalci eng.html The FidaPLUS sources ref References Reflist External links http www.fidaplus.net Index eng.htm Slovenian National Corpus website FidaPLUS Category Corpora Category Slovene language Category Online databases Category Applied linguistics Category Linguistic research sl FidaPLUS ... more details
Unreferenced date December 2009 In the lambda calculus , a term is in beta normal form if no lambda calculus reduction beta reduction is possible. A term is in beta eta normal form if neither a beta reduction nor an lambda calculus conversion eta reduction is possible. A term is in head normal form if there is no beta redex in head position . Beta reduction In the lambda calculus, a beta redex is a term of the form math mathbf lambda x . A x t math where math A x math is a term possibly involving variable math x math . A beta reduction is an application of the following rewrite rule to a beta redex math mathbf lambda x . A x t rightarrow A t math where math A t math is the result of substituting the term math t math for the variable math x math in the term math A x math . A beta reduction is in head position if it is of the following form math lambda x 0 ldots lambda x i 1 . lambda x i . A x i M 1 M 2 ldots M n rightarrow lambda x 0 ldots lambda x i 1 . A M 1 M 2 ldots M n math , where math i geq 0, n geq 1 math . Any reduction not in this form is an internal beta reduction. Reduction strategies In general, there can be several different beta reductions possible for a given term. Normal order reduction is the evaluation strategy in which one continually applies the rule for beta reduction in head position until no more such reductions are possible. At that point, the resulting term is in head normal form . In contrast, in applicative order reduction , one applies the internal reductions first, and then only applies the head reduction when no more internal reductions are possible. Normal order reduction is complete, in the sense that if a term has a head normal form, then normal order reduction will eventually reach it. In contrast, applicative order reduction may not terminate, even when the term has a normal form. For example, using applicative order reduction, the following sequence of reductions is possible math mathbf lambda x . z lambda w. w w w lambda w. w ... more details
ACL2 A Computational Logic for Applicative Common Lisp is a software system consisting of a programming language , an extensible theory in a first order logic , and a mechanical theorem prover . ACL2 is designed to support automated reasoning in inductive logical theories, mostly for the purpose of software and Computer hardware hardware verification. The input language and implementation of ACL2 are built on Common Lisp . ACL2 is free software free , open source GNU General Public License GPL software. The ACL2 programming language is an applicative programming language applicative Side effect computer science side effect free variant of Common Lisp. ACL2 is untyped. All ACL2 Function programming functions are Total function total that is, every function maps each object in the ACL2 Universe mathematics universe to another object in its universe. ACL2 s base theory axiom atizes the semantics of its programming language and its built in functions. User definitions in the programming language that satisfy a definitional principle extend the theory in a way that maintains the theory s Consistency proof logical consistency . The core of ACL2 s theorem prover is based on term rewriting , and this core is extensible in that user discovered theorems can be used as ad hoc Mathematical proof proof techniques for subsequent conjectures . ACL2 is intended to be an industrial strength version of the Boyer Moore theorem prover, Nqthm NQTHM . Toward this goal, ACL2 has many features to support clean engineering of interesting mathematical and computational theories. ACL2 also derives efficiency from being built on Common Lisp for example, the same specification that is the basis for inductive verification can be compiled and run native code natively . In 2005, the authors of the Boyer Moore family of provers, which includes ACL2, received the ACM Software System Award for pioneering and engineering a most effective theorem prover ... as a formal methods tool for verifying safety ... more details
Unreferenced date June 2009 An oblique case list of glossing abbreviations abbreviated sc obl lang la casus generalis in linguistics is a noun case of synthetic language s that is used generally when a noun is the object grammar object of a verb or a preposition . An oblique case can appear in any case relationship except the nominative case of a sentence subject or the vocative case of direct address. Languages with a nominative or an oblique case system also contrast with those that have an absolutive case absolutive or ergative case system. In ergative absolutive language s, the absolutive case is used for a direct object the subject will then be in the ergative case but the absolutive case is also used for the subject of an intransitive verb , where the subject is being passively described, rather than performing an action. Nevertheless, there are ergative absolutive languages that demonstrate oblique cases in the Northwest Caucasian languages Adyghe language Adyghe , Kabardian language Kabardian and Ubykh language Ubykh , the oblique case marker serves to mark the ergative case, the dative case , and the object of a verbal verb applicative applicative . Bulgarian language Bulgarian , an analytic Slavic language , also has an oblique case or, rather, two of them for pronoun s Accusative Kiss me tseluvay me Kiss me not him tseluvay men Dative Give me that ball a day mi tazi topka Give that ball to me a day tazi topka na men There is also one for grammatical gender masculine nouns with the article grammar article The wind is blowing vyat r t vee I despise the wind M mrazya vyat ra In analytic Indo European languages , the oblique case is a relic of the original, more complex system of noun cases from the common Proto Indo European language . Oblique cases appear in the English language English pronoun set these pronouns are often called objective pronoun s. One can observe how the fi ... more details
Infobox programming language name KRC logo paradigm Functional programming functional year 1981 designer David Turner computer scientist David Turner developer latest release version latest release date latest test version latest test date typing implementations dialects influenced by SASL programming language SASL influenced Miranda programming language Miranda operating system license website KRC Kent Recursive Calculator is a lazy evaluation lazy functional language developed by David Turner computer scientist David Turner in or before? 1981 based on SASL programming language SASL , with pattern matching , guard computing guard s and ZF expression s now more usually called list comprehensions . Two implementations of KRC were written David Turner s original one in BCPL running on Edinburgh Multiple Access System EMAS , and Simon Croft s later one in C programming language C under Unix , and KRC was the main language used for teaching functional programming at the University of Kent at Canterbury UK from 1982 to 1985. The direct successor to KRC is Miranda programming language Miranda , which includes a polymorphic type discipline based on that of Milner s ML programming language ML . Further reading Functional Programming and its Applications , David A. Turner, Cambridge U Press 1982. References FOLDOC cite book last Turner first D.A. year 1981 chapter The semantic elegance of Applicative Languages title Proceedings of the 1981 Conference on Functional Programming Languages and Computer Architecture pages 85 92 publisher Association for Computing Machinery isbn 0 89791 060 5 Category Programming languages compu lang stub ru KRC ... more details
Hope is a small functional programming functional programming language developed in the 1970s at University of Edinburgh Edinburgh University . ref name BMS Burstall R.M, MacQueen D.B, Sannella D.T. 1980 Hope An Experimental Applicative Language . Conference Record of the 1980 LISP Conference, Stanford University, pp. 136 143. ref It predates Miranda programming language Miranda and Haskell programming language Haskell and is contemporaneous with ML programming language ML also developed at Edinburgh . It is notable for being the first language with call by pattern evaluation and algebraic data type s. Hope is an important language in the development of functional programming. The name may have been derived from Hope Park Square in Edinburgh, at one time the location of the Department of Artificial Intelligence. A Hope tutorial by Roger Bailey ref http www.soi.city.ac.uk ross Hope hope tut hope tut.html Roger Bailey, A Hope Tutorial ref was featured in the August 1985 issue of Byte magazine Byte on declarative programming . ref http www.devili.iki.fi library issue 136.en.html ref A factorial program in Hope is dec fact num num fact 0 1 fact n n fact n 1 Unlike in Haskell programming language Haskell , changing the order of the clauses would not change the meaning of the program, because Hope s pattern matching always favors more specific patterns over less specific ones. Another way in which Hope differs from Haskell and Category ML programming language family ML is that explicit type declarations in Hope are required there is no option to use a type inference algorithm in Hope. The first implementation of Hope was strict evaluation strict , but since that one there have been lazy evaluation lazy versions and strict versions with lazy constructors the language described in ref name BMS has a lazy constructor for lists only . References reflist External links http www.soi.city.ac.uk ross Hope Hope homepage http haskell.org haskellwiki History of Haskell History of Ha ... more details
RENATER lang fr R seau national de t l communications pour la technologie, l enseignement et la recherche Deployed at the beginning of the 1990s, RENATER National telecommunications network for Technology, Education and Research NREN provides a national and international connectivity via the pan European G ANT network, to more than 1,000 education and research sites in Metropolitan France and Overseas Departments and Territories. The RENATER network is an important and added value tool for research and education. It makes easier the collaborative work of the French researchers with their worldwide colleagues data transfers and acquisitions, videoconferencing, spreadsheets etc. . Its infrastructure is constantly upgraded to fulfill the users needs. RENATER is connected to international networks through a 10 Gbit s link to GEANT and directly to northern United States America through two 2.5 Gbit s links. RENATER supports IPv6. Services The following services are offered to RENATER s community Network services Connectivity End to end circuits VPN MPLS, optical paths... Classes of service Resource management prefixe allocation, domain names registration,... Applicative services Authentication services server and person certificates Education Research identity Federation Anti spam service Mobility service eduroamTM Voice and image services ToIP and video Security service CERT External links http www.renater.fr Official website French http www.renater.fr ?lang en english version Category Academic computer network organizations Category Science and technology in France compu network stub fr R seau national de t l communications pour la technologie, l enseignement et la recherche ... more details
shaum003.pdf online. Shaumyan s theory of applicative grammar was developed, reinforced, and extended ... sceptical of Chomskyan theory. Applicative Universal Grammar AUG The core of Shaumyan s linguistic theory is Applicative Universal Grammar or AUG. The theory was first introduced in his book Strukturnaja lingvistika Structural Linguistics , published in Moscow in 1965. Applicative Universal Grammar .... This reveals the applicative structure of a particular phrase and helps us to concentrate ... more details
of object valency decrease unaccusative or unergative valency increase causative, applicative direction ... s which add a new subject as agent grammar agent or applicative grammar applicative s which add a new ... more details
programming applicative programming his function level programming is a particular, constrained type of applicative programming . A key distinction from functional languages is that Backus language ... more details
KAOS or Kaos may refer to People Kaos of Iberia , an ancient king of Causasian Iberia Kaos, professional wrestler Joey Munoz Kaos or Kenny Kaos, professional wrestler Kenny Stasiowski Kaos, the name by which Thai film director Wych Kaosayananda is credited in the film Ballistic Ecks vs. Sever Fiction KAOS Get Smart , a criminal spy agency in the television series Get Smart Kaos film Kaos film , a 1984 Italian film directed by Paolo and Vittorio Taviani The Ancient One Kaos , a character from the anime Ronin Warriors List of Battle Angel Alita characters Kaos Kaos , a manga character from Battle Angel Alita Anthropomorphic personifications Discworld Kaos, aka Ronnie Soak Kaos, aka Ronnie Soak , the fictional Fifth Horseman of the Apocalypse in the Discworld novel Thief of Time In video gaming Kaos Studios , a defunct video game developer KAOS, the cyborgnetic leader of the Kremling Krew in Donkey Kong Country 3 Dixie Kong s Double Trouble KAOS Killing as organised sport , an alternative name for Assassin game Assassin game KAOS, the antagonist computer from the game Red Alarm Music KAOS FM , a radio station 89.3 FM licensed to The Evergreen State College in Olympia, Washington, United States Radio KAOS Slovenia , a cable Internet radio station Kaos album Kaos album , an album by Bo Kaspers Orkester KAOS, a 1958 novelty 45 RPM record by Stanley Ralph Ross and Bob Arbogast Computing KAoS, policy services framework from the Florida Institute for Human and Machine Cognition Kent Applicative Operating System , a functional operating system concept KAOS software development , a goal oriented software requirements capturing approach in requirements engineering Kernel Attached Operating System , a Linux based virtualization platform and operating system Other KAOS Worldwide , makers of technical clothing systems Assassin game Killing as an Organized Sport , a live action game once commonly played at high schools and colleges. Kaos Software, a make of silicone body jewellery ... more details
wiktionary Kent Kent is a county in South East England, centre of the former Kingdom of Kent . Kent may also refer to TOC right Places Canada Kent, British Columbia Kentville, Nova Scotia Chatham Kent, Ontario Kent County, New Brunswick United States Counties Kent County, Delaware Kent County, Maryland Kent County, Michigan Kent County, Rhode Island Kent County, Texas New Kent County, Virginia Cities and towns Kent, California Kent, California, former name of Kentfield, California Kent, Connecticut Kent, Florida Kent, Iowa Kent, Illinois Kent, Jefferson County, Indiana Kent, Minnesota Kent, New York Kent, Ohio Kent, Oregon Kent, Texas Kent, Washington Kent Acres, Delaware Kent City, Michigan Kent Narrows, Maryland Kentland, Indiana Fort Kent, Maine South Kent, Connecticut Electoral districts Kent New Brunswick electoral district 1867 1966 Kent Ontario electoral district 1867 1903 1914 1966 1976 1996 Kent provincial electoral district New Brunswick Physical features Kent Group of islands, in Bass Strait, Australia Kent Island, Maryland , United States Kent Narrows , Maryland, United States Kent Peninsula in Canada The River Kent , Cumbria, England Education United Kingdom University of Kent , Kent, England United States Kent State University , Kent, Ohio Kent State shootings Kent City School District , a public school district in Kent, Ohio Kent School District , a public school district in Kent, Washington Kent School , a private high school in Kent, Connecticut Chicago Kent College of Law , Chicago, Illinois Transportation Ford Kent engine , used in for instance Ford Anglia HMS Kent HMS Kent , a ship Kent Station OC Transpo , a bus stop in Ottawa s downtown transit corridor Kent Street Ottawa , a major downtown street in Ottawa New Kent Road in London Old Kent Road in London People Kent surname Duke of Kent Earl of Kent Music Kent band , a Swedish rock band Kent album Kent album , their first album Other uses KENT , a radio station Kent Applicative Operating System ... more details
Encyclopedia
top
