Order Types

Ordered Sets ◽  
1982 ◽  
pp. 793-798
Author(s):  
Ivan Rival
Keyword(s):  
Order Types

scholarly journals Characterization of order types of pointwise linearly ordered families of Baire class 1 functions

2017 ◽  
Vol 307 ◽  
pp. 559-597 ◽  
Author(s):  
Márton Elekes ◽  
Zoltán Vidnyánszky
Keyword(s):  
Baire Class ◽  
Order Types ◽  
Class 1

Orders and Order Types

Set Theory ◽  
2001 ◽  
pp. 59-63
Author(s):  
Robert L. Vaught
Keyword(s):  
Order Types

Word Order and Agreement in Tagoi

2020 ◽  
Vol 51 (1) ◽  
pp. 161-174
Author(s):  
Suzan Alamin
Keyword(s):  
Noun Phrase ◽  
Word Order ◽  
Class System ◽  
Order Types ◽  
Sentence Level ◽  
Constituent Order ◽  
Noun Class ◽  
South Kordofan

Abstract This study provides a detailed description of word order types, agreement patterns and alternations found in Tagoi, a Kordofanian language traditionally spoken in South Kordofan. After a brief presentation of the language (section 1), the noun class system is introduced (section 2) and the word order and agreement patterns are examined at the noun phrase level (section 3). Section 4 gives information about the constituent order at clause and sentence level, while Section 5 summarizes the findings and conclusion of the paper. All in all, the paper aims at contributing to a better understanding of the grammar, structure and typological features of Tagoi.

Sound and complete models of contracts

2006 ◽  
Vol 16 (4-5) ◽  
pp. 375-414 ◽  
Author(s):  
MATTHIAS BLUME ◽  
DAVID McALLESTER
Keyword(s):  
Ad Hoc ◽  
Expressive Power ◽  
Higher Order ◽  
Original Version ◽  
Order Types ◽  
Restricted Form ◽  
Soundness And Completeness ◽  
Recursive Contracts ◽  
Intuitive Interpretation ◽  
Typed Languages

Even in statically typed languages it is useful to have certain invariants checked dynamically. Findler and Felleisen gave an algorithm for dynamically checking expressive higher-order types called contracts. They did not, however, give a semantics of contracts. The lack of a semantics makes it impossible to define and prove soundness and completeness of the checking algorithm. (Given a semantics, a sound checker never reports violations that do not exist under that semantics; a complete checker is – in principle – able to find violations when violations exist.) Ideally, a semantics should capture what programmers intuitively feel is the meaning of a contract or otherwise clearly point out where intuition does not match reality. In this paper we give an interpretation of contracts for which we prove the Findler-Felleisen algorithm sound and (under reasonable assumptions) complete. While our semantics mostly matches intuition, it also exposes a problem with predicate contracts where an arguably more intuitive interpretation than ours would render the checking algorithm unsound. In our semantics we have to make use of a notion of safety (which we define in the paper) to avoid unsoundness. We are able to eliminate the “leakage” of safety into the semantics by changing the language, replacing the original version of unrestricted predicate contracts with a restricted form. The corresponding loss in expressive power can be recovered by making safety explicit as a contract. This can be done either in ad-hoc fashion or by including general recursive contracts. The addition of recursive contracts has far-reaching implications, deeply affecting the formulation of our model and requiring different techniques for proving soundness.

Sign in / Sign up

Export Citation Format

Share Document