scholarly journals Regular language type inference with term rewriting

2020 ◽  
Vol 4 (ICFP) ◽  
pp. 1-29
Author(s):  
Timothée Haudebourg ◽  
Thomas Genet ◽  
Thomas Jensen
Keyword(s):  
Regular Language ◽  
Term Rewriting ◽  
Type Inference ◽  
Language Type

Timbuk 4: Regular Language Type Inference with Term Rewriting

2020 ◽  
Author(s):  
Timothée Haudebourg ◽  
Thomas Genet ◽  
Thomas Jensen
Keyword(s):  
Regular Language ◽  
Term Rewriting ◽  
Type Inference ◽  
Language Type

Posesivní Genitiv Redivivus

2018 ◽  
Vol 69 (3) ◽  
pp. 497-501
Author(s):  
Oldřich Uličný
Keyword(s):  
Written Form ◽  
Last Stage ◽  
Agglutinative Language ◽  
Language Type

Abstract In the contemporary Czech, in both spoken and especially in written form, possessive adjectives are replaced by possessive genitives, which are originally colloquial constructions only. In the last stage of this development, the postpositive genitive changes into prepositive: Klárčina maminka, maminka Klárky, Klárky maminka (‘Klárka’s mother’). The Czech language thus loses another means of inflection and gets closer to an agglutinative language type. This change (deflective tendency) is also supported by the loss of introflexion, i.e. the loss of morphophonological alternations, in our example k – č, in other cases r – ř, g – ž, ch – š, etc. (Klárčin – Klárky [‘Klárka’s’], sestra – sestřin [‘sister’s’], Olga – Olžin [‘Olga’s’] etc.).

Iterative type inference with attribute grammars

2011 ◽  
Vol 46 (2) ◽  
pp. 43-52 ◽  
Author(s):  
Arie Middelkoop ◽  
Atze Dijkstra ◽  
S. Doaitse Swierstra
Keyword(s):  
Type Inference ◽  
Attribute Grammars

A practical framework for type inference error explanation

2016 ◽  
Vol 51 (10) ◽  
pp. 781-799 ◽  
Author(s):  
Calvin Loncaric ◽  
Satish Chandra ◽  
Cole Schlesinger ◽  
Manu Sridharan
Keyword(s):  
Type Inference ◽  
Error Explanation

Type Inference: Some Results, Some Problems1

1993 ◽  
Vol 19 (1-2) ◽  
pp. 87-125
Author(s):  
Paola Giannini ◽  
Furio Honsell ◽  
Simona Ronchi Della Rocca
Keyword(s):  
Large Class ◽  
Higher Order ◽  
Type Inference ◽  
Principal Type ◽  
Open Problems ◽  
Inference Problem ◽  
Type Assignment ◽  
Unification Problem

In this paper we investigate the type inference problem for a large class of type assignment systems for the λ-calculus. This is the problem of determining if a term has a type in a given system. We discuss, in particular, a collection of type assignment systems which correspond to the typed systems of Barendregt’s “cube”. Type dependencies being shown redundant, we focus on the strongest of all, Fω, the type assignment version of the system Fω of Girard. In order to manipulate uniformly type inferences we give a syntax directed presentation of Fω and introduce the notions of scheme and of principal type scheme. Making essential use of them, we succeed in reducing the type inference problem for Fω to a restriction of the higher order semi-unification problem and in showing that the conditional type inference problem for Fω is undecidable. Throughout the paper we call attention to open problems and formulate some conjectures.

Sign in / Sign up

Export Citation Format

Share Document