Manfred Schmidt-Schauß  Home/Search
Context
Related
Links: ACM DBLP | ki.informatik.unifrank...bouncsl.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: ki.informatik.unifran...articles (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: It is well-known that first order unification is decidable, whereas second order (and higher-order) unification is undecidable. (Update)
Active bibliography (related documents): More All
1.3: A Decision Algorithm for Stratified Context Unification - Schmidt-Schauß (2001) (Correct)
0.8: An Optimized Decision Algorithm for Stratified Context.. - Schmidt-Schauß (2000) (Correct)
0.6: Describing Lambda Terms in Context Unification - Niehren, Villaret (Correct)
Similar documents based on text: More All
0.2: Decidability of Bounded Higher-Order Unification - Schmidt-Schauß, Schulz (2002) (Correct)
0.2: Mobile Telescript Agents and the Web - Dömel (1996) (Correct)
0.2: Solvability of Context Equations with two Context.. - Schmidt-Schauß, Schulz (1999) (Correct)
BibTeX entry: (Update)
@misc{ schmidt-schau-decidability,
author = "Manfred Schmidt-Schauß",
title = "Decidability of Bounded Second Order Unification",
url = "citeseer.ist.psu.edu/621708.html" }
Citations (may not include all citations):174 A unification algorithm for typed -calculus (context) - Huet - 1975
134 Unification theory - Baader, Siekmann - 1994 ACM DBLP
105 The problem of solvability of equations in a free semigroup (context) - Makanin - 1977
97 The undecidability of the second-order unification problem (context) - Goldfarb - 1981 DBLP
56 Higher-order unification revisited: Complete sets of transfo.. (context) - Snyder, Gallier - 1989 ACM DBLP
24 Satisfiability of word equations with constants is in PSPACE (context) - Plandowski - 1999 ACM DBLP
24 Satisfiability of word equations with constants is in NEXPTI.. (context) - Plandowski - 1999 ACM DBLP
19 Simple second-order languages for which unification is undec.. (context) - Farmer - 1991 ACM DBLP
19 the exponent of periodicity of minimal solutions of context .. (context) - Schmidt-Schau, Schulz - 1998
17 A unification algorithm for second order monadic terms (context) - Farmer - 1988
12 Solvability of context equations with two context variables .. - Schmidt-Schau, Schulz - 1999 ACM DBLP
11 Linear second order unification (context) - Levy - 1996
9 Decidable and undecidable second order unification problems - Levy - 1998
6 On unification problems in restricted second order languages - Levy, Veanes - 1998
6 Unification of stratified second-order terms (context) - Schmidt-Schau - 1994
6 Satisfiability of word equations with constants is in expone.. (context) - Gutierrez - 1998 ACM DBLP
3 A decision algorithm for distributive unification (context) - Schmidt-Schau - 1998 ACM DBLP
3 Number 21 in Cambridge tracts in theoretical computer scienc.. (context) - Wolfram, theories - 1993
1 Solvability of context equations with two variables is decid.. (context) - Schmidt-Schau, Schulz - 1998
Documents on the same site (http://www.ki.informatik.uni-frankfurt.de/papers/articles.html): More
Tinte: developing a prototype for typesetting music in Clean - a.. - Panitz (Correct)
A Partial Rehabilitation of Side-Effecting I/O.. - Schmidt-Schauß (1996) (Correct)
The G#-machine: Efficient strictness analysis in Haskell - Schütz (1995) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC