scholarly journals Type Inference with Nonstructural Subtyping

1995 ◽  
Vol 2 (33) ◽  
Author(s):  
Jens Palsberg ◽  
Mitchell Wand ◽  
Patrick O'Keefe
Keyword(s):  
Type A ◽  
Type Inference ◽  
Inference Algorithm ◽  
Minimal Size ◽  
The One ◽  
Time Type

We present an O(n^3) time type inference algorithm for a type<br />system with a largest type !, a smallest type ?, and the usual ordering<br />between function types. The algorithm infers type annotations of<br />minimal size, and it works equally well for recursive types. For the<br />problem of typability, our algorithm is simpler than the one of Kozen,<br />Palsberg, and Schwartzbach for type inference without ?. This may<br />be surprising, especially because the system with ? is strictly more<br />powerful.

scholarly journals A Type Inference Algorithm for a Stratified Polymorphic Type Discipline

1994 ◽  
Vol 109 (1-2) ◽  
pp. 115-173 ◽  
Author(s):  
P. Giannini ◽  
S.R. Dellarocca
Keyword(s):  
Type Inference ◽  
Inference Algorithm ◽  
Polymorphic Type

Secondary High Tones in Koshikijima Japanese

2019 ◽  
Vol 36 (1) ◽  
pp. 25-50
Author(s):  
Haruo Kubozono
Keyword(s):  
Type A ◽  
Type B ◽  
The South ◽  
Time And Space ◽  
Regional Variations ◽  
South Of Japan ◽  
Remote Islands ◽  
The One ◽  
And Behavior

Abstract This paper examines the nature and behavior of secondary H(igh) tones in Koshikijima Japanese, a highly endangered dialect spoken on three small, remote islands in the south of Japan. This dialect generally has a mora-counting prosodic system with two distinctive accent types/classes (Type A and Type B), and displays two H tones, primary and secondary, in words of three or more moras: The primary H tone appears on the penultimate and final moras in Type A and Type B, respectively, whereas the secondary H tone occurs at the beginning of the word redundantly. Koshikijima Japanese displays regional variations with respect to the secondary H tone, particularly regarding its domain/position, its (in)dependence on the primary H tone, its interaction with the syllable, and its behavior in postlexical phonology. This paper examines how the secondary H tone behaves differently in three distinct accent systems of the dialect: (i) the system described by Takaji Kamimura eighty years ago, (ii) the one that is found quite extensively on the islands today, including Kamimura’s native village (Nakakoshiki) and Teuchi Village, and (iii) the system observed in Kuwanoura Village today. Comparing the three accent systems, this paper also proposes historical scenarios to account for the different behaviors of the secondary H tone across time and space.

FIRST-CLASS CONTEXTS IN ML

2000 ◽  
Vol 11 (01) ◽  
pp. 65-87
Author(s):  
MASATOMO HASHIMOTO
Keyword(s):  
Programming Language ◽  
Operational Semantics ◽  
Type System ◽  
Type Inference ◽  
Inference Algorithm ◽  
Hole Filling ◽  
Dynamic Binding ◽  
Polymorphic Type ◽  
Open Program ◽  
Program Modules

This paper develops an ML-style programming language with first-class contexts i.e. expressions with holes. The crucial operation for contexts is hole-filling. Filling a hole with an expression has the effect of dynamic binding or macro expansion which provides the advanced feature of manipulating open program fragments. Such mechanisms are useful in many systems including distributed/mobile programming and program modules. If we can treat a context as a first-class citizen in a programming language, then we can manipulate open program fragments in a flexible and seamless manner. A possibility of such a programming language was shown by the theory of simply typed context calculus developed by Hashimoto and Ohori. This paper extends the simply typed system of the context calculus to an ML-style polymorphic type system, and gives an operational semantics and a sound and complete type inference algorithm.

Delayed Choice with Correlated Photons

1988 ◽  
Vol 43 (2) ◽  
pp. 110-114
Author(s):  
O. E. Rössler
Keyword(s):  
Quantum Mechanics ◽  
Choice Experiment ◽  
Foundations Of Quantum Mechanics ◽  
Type A ◽  
The Other ◽  
Delayed Choice ◽  
Epr Experiment ◽  
The One

Abstract A new experiment in the foundations of quantum mechanics is proposed. The existence of correlated photons -first seen by Wheeler -can be taken as a hint to devise a ‘‘double-wing’’ delayed choice experiment in Wheeler’s sense. A path choice (polarization choice) measurement made on the one side should then block an interference type measurement made on the other side (‘‘distant choice’’). A precondition for the combined measurement to work in theory is that the correlated photons used are of the ‘‘prepolarized’’ (Selleri) rather than the ‘‘unpolarized’’ (Böhm) type. A first EPR experiment involving prepolarized photons was recently performed by Alley and Shih. It may be used as a partial experiment within the proposed experiment.

Ordering Disorder

2013 ◽  
Author(s):  
George Graham
Keyword(s):  
Mental Disorders ◽  
Mental Disorder ◽  
Type A ◽  
The Other ◽  
Brain Disorder ◽  
The Difference ◽  
The One ◽  
The Brain

The basic claims of the chapter are, first, that mental disorders are not best understood as types of brain disorder, even though mental disorders are based in the brain. And, second, that the difference between the two sorts of disorders can be illuminated by the sorts of treatment or therapy that may work for the one type (a mental disorder) but not for the other type (a brain disorder). In the discussion some of the diagnostic implications and difficulties associated with these two basic claims are outlined.

Weak polymorphism can be sound

1996 ◽  
Vol 6 (1) ◽  
pp. 111-141 ◽  
Author(s):  
John Greiner
Keyword(s):  
New Jersey ◽  
Type System ◽  
Type Systems ◽  
Type Inference ◽  
Inference Algorithm ◽  
Standard Ml ◽  
Polymorphic Type

AbstractThe weak polymorphic type system of Standard ML of New Jersey (SML/NJ) (MacQueen, 1992) has only been presented as part of the implementation of the SML/NJ compiler, not as a formal type system. As a result, it is not well understood. And while numerous versions of the implementation have been shown unsound, the concept has not been proved sound or unsound. We present an explanation of weak polymorphism and show that a formalization of this is sound. We also relate this to the SML/NJ implementation of weak polymorphism through a series of type systems that incorporate elements of the SML/NJ type inference algorithm.

scholarly journals Constraint handling rules with binders, patterns and generic quantification

2017 ◽  
Vol 17 (5-6) ◽  
pp. 992-1009
Author(s):  
ALEJANDRO SERRANO ◽  
JURRIAAN HAGE
Keyword(s):  
Type Inference ◽  
Constraint Handling ◽  
Inference Algorithm ◽  
Higher Rank ◽  
Binding Structure

AbstractConstraint handling rules provide descriptions for constraint solvers. However, they fall short when those constraints specify some binding structure, like higher-rank types in a constraint-based type inference algorithm. In this paper, the term syntax of constraints is replaced by λ-tree syntax, in which binding is explicit, and a new ∇ generic quantifier is introduced, which is used to create new fresh constants.

Sign in / Sign up

Export Citation Format

Share Document