%
% GENERATED FROM https://www.coli.uni-saarland.de
%    by   : anonymous
%    IP   : coli2006.lst.uni-saarland.de
%    at   : Mon, 05 Feb 2024 15:43:45 +0100 GMT
%    
% Selection : Reference #83
%




@TechReport{Backofen_Krieger:1993,
      AUTHOR = {Backofen, Rolf and Krieger, Hans-Ulrich},
      TITLE = {The TDL/ UDiNe System},
      YEAR = {1993},
      NUMBER = {D-93-27},
      PAGES = {67-74},
      ADDRESS = {Saarbrücken},
      TYPE = {DFKI Document},
      INSTITUTION = {DFKI},
      URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/tdl-udine.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/tdl-udine.entry},
      ABSTRACT = {TDL is a typed feature-based language specifically designed to support highly lexicalized grammar theories like HPSG, FUG, or CUG. TDL offers the possibility to define (possibly recursive) types, consisting of type constraints and feature constraints over the standard connectives AND, OR, and NOT, where the types are arranged in a subsumption hierarchy. TDL distinguishes between AVM types (open-world reasoning) and SORT types (closed-world reasoning) and allows the declaration of partitions and incompatible types. Working with partially as well as with fully expanded types is possible, both at definition and at run time. TDL is incremental, i.e., it allows the redefinition of types and the use of undefined types.},
      ANNOTE = {COLIURL : Backofen:1993:TUS.pdf Backofen:1993:TUS.ps}
}