Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 230,701,596 papers from all fields of science
Search
Sign In
Create Free Account
Hindley–Milner type system
Known as:
Let generalization
, Hindley-Milner type system
, Hindley-Milner type inference
Expand
In type theory and functional programming, Hindley–Milner (HM), also known as Damas–Milner or Damas–Hindley–Milner, is a classical type system for…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
23 relations
Attribute grammar
Disjoint-set data structure
Formal system
Free variables and bound variables
Expand
Broader (5)
Formal methods
Lambda calculus
Theoretical computer science
Type inference
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2009
2009
Perspectivas clásicas y contemporáneas acerca de la memoria
Eliana Ruetti
,
Nadia Justel
,
Mariana Bentosela
2009
Corpus ID: 145573299
Los seres humanos organizan los acontecimientos pasados como “memorias”, es decir, todo lo que aprenden se codifica y almacena en…
Expand
2003
2003
Coercions in Hindley-Milner Systems
R. Kießling
,
Zhaohui Luo
Types for Proofs and Programs
2003
Corpus ID: 1274848
Coercive subtyping is a theory of abbreviation for dependent type theories. In this paper, we incorporate the idea of coercive…
Expand
2000
2000
Erdős–Ko–Rado and Hilton–Milner Type Theorems for Intersecting Chains in Posets
P. Erdös
,
Á. Seress
,
L. Székely
Comb.
2000
Corpus ID: 9570908
t-intersecting k-chains in posets using the kernel method. These results are common generalizations of the original EKR and HM…
Expand
2000
2000
A Polymorphic Environment Calculus and its Type-Inference Algorithm
S. Nishizaki
High. Order Symb. Comput.
2000
Corpus ID: 23600700
The polymorphic environment calculus is a polymorphic lambda calculus which enables us to treat environments as first-class…
Expand
1999
1999
Deriving a Statically Typed Type-Directed Partial Evaluator
Morten Rhiger
ACM SIGPLAN Workshop on Partial Evaluation and…
1999
Corpus ID: 14237418
Type-directed partial evaluation was originally implemented in Scheme, a dynamically typed language. It has also been implemented…
Expand
1999
1999
Explicitly Typed lambda µ-Calculus for Polymorphism an Call-by-Value
Ken-etsu Fujita
International Conference on Typed Lambda Calculus…
1999
Corpus ID: 6350918
We introduce an explicitly typed λµ-calculus of call-by-value as a short-hand for the 2nd order Church-style. Our motivation…
Expand
1994
1994
Using Hindley-Milner type inference to optimise list representation
Cordelia V. Hall
LFP '94
1994
Corpus ID: 16542279
Lists are a pervasive data structure in functional programs. The generality and simplicity of their structure makes them…
Expand
1993
1993
A framework for optimising abstract data types
Cordelia V. Hall
Functional Programming
1993
Corpus ID: 59881705
Hindley-Milner type inference and partial evaluation are all that is needed to optimise lists, yielding considerable improvements…
Expand
1991
1991
Strictness Analysis Using Hindley-Milner Type Inference
Cordelia V. Hall
Functional Programming
1991
Corpus ID: 40619734
For many years, abstract interpretation has been thought of as the best way to formalize the analysis of semantic properties of…
Expand
Review
1990
Review
1990
Polymorphic Constructs in Natural and Programming Languages
Hans Leiss
European Conference on Logics in Artificial…
1990
Corpus ID: 35162419
Problems in parsing conjoined phrases with conjuncts of different syntactic type can apparently be overcome with techniques…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE