Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Teoría ecuaciónal")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 355

  • Page / 15
Export

Selection :

  • and

Constructive rewritingNIPKOW, T.Computer journal (Print). 1991, Vol 34, Num 1, pp 34-41, issn 0010-4620, 8 p.Article

Solving word equationsABDULRAB, H.Informatique théorique et applications (Imprimé). 1990, Vol 24, Num 2, pp 109-130, issn 0988-3754, 22 p.Article

Comments on : Logic programming with equationsBOSCO, P. G; GIOVANNETTI, E; MOISO, C et al.The Journal of logic programming. 1991, Vol 11, Num 1, pp 85-89, issn 0743-1066, 5 p.Article

Order-sorted term rewritingDICK, A. J. J; WATSON, P.Computer journal (Print). 1991, Vol 34, Num 1, pp 16-19, issn 0010-4620, 4 p.Article

Unification modulo an equality theory for equational logic programmingJIA-HUAI YOU.Journal of computer and system sciences (Print). 1991, Vol 42, Num 1, pp 54-75, issn 0022-0000, 22 p.Article

Stratified context unification is in PSPACESCHMIDT-SCHAUSS, Manfred.Lecture notes in computer science. 2001, pp 498-512, issn 0302-9743, isbn 3-540-42554-3Conference Paper

ACID-unification is NEXPTIME-decidableANANTHARAMAN, Siva; NARENDRAN, Paliath; RUSINOWITCH, Michael et al.Lecture notes in computer science. 2003, pp 169-178, issn 0302-9743, isbn 3-540-40671-9, 10 p.Conference Paper

Beyond regularity: Equational tree automata for associative and commutative theoriesOHSAKI, Hitoshi.Lecture notes in computer science. 2001, pp 539-553, issn 0302-9743, isbn 3-540-42554-3Conference Paper

Paramodulation, superposition, and simplificationBACHMAIR, L.Lecture notes in computer science. 1997, pp 1-3, issn 0302-9743, isbn 3-540-63385-5Conference Paper

The word matching problem is undecidable for finite special string-rewriting systems that are confluentNARENDRAN, P; OTTO, F.Lecture notes in computer science. 1997, pp 638-648, issn 0302-9743, isbn 3-540-63165-8Conference Paper

The new WALDMEISTER loop at workGAILLOURDET, Jean-Marie; HILLENBRAND, Thomas; LÖCHNER, Bernd et al.Lecture notes in computer science. 2003, pp 317-322, issn 0302-9743, isbn 3-540-40559-3, 6 p.Conference Paper

Foundations of equational logic programmingHÖLLDOBLER, Steffen.Lecture notes in computer science. 1989, Vol 353, issn 0302-9743, X-250 p. [260 p.]Serial Issue

Coalgebraic methods in computer scienceJACOBS, Bart; RUTTEN, Jan.Theoretical computer science. 2002, Vol 280, Num 1-2, issn 0304-3975, 194 p.Conference Proceedings

Isomorphisme et équivalence équationnelle entre modèles du lambda-calcul = Isomorphism and Equational Equivalence of Models of Lambda-CalculusKerth, Rainer; Berline, C.1995, 105 p.Thesis

A new approach for combining decision procedures for the word problem, and its connection to the Nelson-Oppen combination methodBAADER, F; TINELLI, C.Lecture notes in computer science. 1997, pp 19-33, issn 0302-9743, isbn 3-540-63104-6Conference Paper

Kleene algebra with tests : Completeness and decidabilityKOZEN, D; SMITH, F.Lecture notes in computer science. 1997, pp 244-259, issn 0302-9743, isbn 3-540-63172-0Conference Paper

Monadic simultaneous rigid E-unification and related problemsGUREVICH, Y; VORONKOV, A.Lecture notes in computer science. 1997, pp 154-165, issn 0302-9743, isbn 3-540-63165-8Conference Paper

The minimal graph model of lambda calculusBUCCIARELLI, Antonio; SALIBRA, Antonino.Lecture notes in computer science. 2003, pp 300-307, issn 0302-9743, isbn 3-540-40671-9, 8 p.Conference Paper

Type introduction for equational rewritingMIDDELDORP, A; OHSAKI, H.Acta informatica. 2000, Vol 36, Num 12, pp 1007-1029, issn 0001-5903Article

An extended Theory of primitive objects : First order systemLIQUORI, L.Lecture notes in computer science. 1997, pp 146-169, issn 0302-9743, isbn 3-540-63089-9Conference Paper

Some Varieties of Equational Logic (Extended Abstract)PLOTKIN, Gordon.Algebra, meaning, and computation (essays dedicated to Joseph A. Goguen on the occasion of his 65th birthday). Lecture notes in computer science. 2006, pp 150-156, issn 0302-9743, isbn 3-540-35462-X, 1Vol, 7 p.Book Chapter

Certifying and synthesizing membership equational proofsROSU, Grigore; EKER, Steven; LINCOLN, Patrick et al.Lecture notes in computer science. 2003, pp 359-380, issn 0302-9743, isbn 3-540-40828-2, 22 p.Conference Paper

Equational prover of THEOREMAKUTSIA, Temur.Lecture notes in computer science. 2003, pp 367-379, issn 0302-9743, isbn 3-540-40254-3, 13 p.Conference Paper

Combination of distributed search and multi-search in peers-mcd.d: (System description)BONACINA, Maria Paola.Lecture notes in computer science. 2001, pp 448-452, issn 0302-9743, isbn 3-540-42254-4Conference Paper

Complete categorical equational deductionROSU, Grigore.Lecture notes in computer science. 2001, pp 528-538, issn 0302-9743, isbn 3-540-42554-3Conference Paper

  • Page / 15