1994 · 77 citations · 8 references
ComputingComputer ScienceNatural Language ProcessingProgramming LanguagesSyntaxType CheckingType SystemsConstraintsType ConstraintsType Inference
This paper presents "FD~g, a typed feal, ure-bascd rein'csent, el;ion language att(l ild'erence system. Type definitions in TDL consis~ of type and feature constraints over the Imolean cmme(Mves. TD supports open-and closed-worM reasoning over types and allows for par|;itions and iueompal;i[)le I.ypes. Working with l)artially as well as with lhlly expanded types is possible. E[lieienl. reasoning in "]'1)12 is accomplished through Sl)Ccialized mtMules.
8
Efficient implementation of lattice operations
Hassan Aı̈t-Kaci, Robert S. Boyer, Patrick Lincoln et al. · ACM Transactions on Programming Languages and Systems · 1989 · 199 citations · Full text
Inheritance and constraint-based grammar formalisms
Rémi Zajac · 1992 · 41 citations
Hans Uszkoreit, Günter Neumann, Stephan Oepen et al. · 1994 · 38 citations · Full text