BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Austria
1 × Canada
1 × France
1 × United Kingdom
2 × Italy
7 × USA
Collaborated with:
S.Raatz W.Snyder V.Tannen T.Isakowitz A.Pelin F.Jalili P.Narendran D.A.Plaisted
Talks about:
rewrit (4) unif (4) program (3) logic (3) equat (3) procedur (2) general (2) complet (2) algebra (2) semant (2)

Person: Jean H. Gallier

DBLP DBLP: Gallier:Jean_H=

Contributed to:

RTA 19931993
ICALP 19891989
CADE 19881988
ICLP/SPL 19881988
LICS 19881988
LICS 19871987
RTA 19871987
SLP 19861986
SLP 19851985
CADE 19841984
POPL 19821982
ICALP 19791979
ICALP 19781978

Wrote 14 papers:

RTA-1993-Gallier #proving
Proving Properties of Typed λ Terms: Realizability, Covers, and Sheaves (JHG), p. 136.
ICALP-1989-TannenG #algebra #confluence #normalisation #polymorphism
Polymorphic Rewriting Conserves Algebraic Strong Normalization and Confluence (VT, JHG), pp. 137–150.
CADE-1988-GallierNPRS #canonical #equation #finite #polynomial #set #term rewriting
Finding Canonical Rewriting Systems Equivalent to a Finite Set of Ground Equations in Polynomial Time (JHG, PN, DAP, SR, WS), pp. 182–196.
JICSCP-1988-GallierI88 #equation #logic #order
Rewriting in Order-sorted Equational Logic (JHG, TI), pp. 280–294.
JICSCP-1988-RaatzG88 #logic programming #relational #semantics
A Relational Semantics for Logic Programming (SR, JHG), pp. 1024–1035.
LICS-1988-GallierSNP
Rigid E-Unification is NP-Complete (JHG, WS, PN, DAP), pp. 218–227.
LICS-1987-GallierRS #equation #proving #theorem proving #using
Theorem Proving Using Rigid E-Unification Equational Matings (JHG, SR, WS), pp. 338–346.
RTA-1987-GallierS
A General Complete E-Unification Procedure (JHG, WS), pp. 216–227.
SLP-1986-GallierR86 #horn clause #similarity
SLD-Resolution Methods for Horn Clauses with Equality Based on E-Unification (JHG, SR), pp. 168–179.
SLP-1985-GallierR85 #graph grammar #logic programming
Logic Programming and Graph Rewriting (JHG, SR), pp. 208–219.
CADE-1984-PelinG #algebra #complexity #problem #using #word
Solving Word Problems in Free Algebras Using Complexity Functions (AP, JHG), pp. 476–495.
POPL-1982-JaliliG #parsing
Building Friendly Parsers (FJ, JHG), pp. 196–206.
ICALP-1979-Gallier #recursion
Recursion Schemes and Generalized Interpretations (JHG), pp. 256–270.
ICALP-1978-Gallier #correctness #nondeterminism #recursion #semantics #source code
Semantics and Correctness of Nondeterministic Flowchart Programs with Recursive Procedures (JHG), pp. 251–267.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.