scientific article; zbMATH DE number 6917940
DOI10.23638/LMCS-14(3:6)2018zbMATH Open1447.68005arXiv1805.11988MaRDI QIDQ4580325FDOQ4580325
Authors: Clément Aubert, Marc Bagnol 
Publication date: 15 August 2018
Full work available at URL: https://arxiv.org/abs/1805.11988
Title of this publication is not available (Why is that?)
Recommendations
- Logic programming and logarithmic space
- Unification and Logarithmic Space
- scientific article; zbMATH DE number 1342271
- Syntactic unification as a geometric operation in free modules over certain rings
- Interaction graphs: graphings
- Unification as a complexity measure for logic programming
- Publication:2778827
- A modified GoI interpretation for a linear functional programming language and its adequacy
- Logic Programming with Focusing Proofs in Linear Logic
- scientific article; zbMATH DE number 785046
proof theorylogarithmic spacegeometry of interactionpointer machinesimplicit complexityunification algebra
Formal languages and automata (68Q45) Logic programming (68N17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Grammars and rewriting systems (68Q42) Proof-theoretic aspects of linear logic and other substructural logics (03F52)
Cites Work
- Bounded linear logic: A modular approach to polynomial-time computability
- A new recursion-theoretic characterization of the polytime functions
- Linear logic and elementary time
- On non-determinacy in simple computing devices
- Elementary complexity and geometry of interaction
- Logarithmic space and permutations
- Nondeterministic Space is Closed under Complementation
- Title not available (Why is that?)
- Normativity in logic
- Geometry of interaction. V: Logic in the hyperfinite factor
- Quasi-interpretations. A way to control resources
- Interaction graphs: additives
- On the sequential nature of unification
- A Machine-Oriented Logic Based on the Resolution Principle
- The method of forced enumeration for nondeterministic automata
- Unification: a multidisciplinary survey
- Unary resolution: characterizing \textsc{Ptime}
- Three lightings of logic (Invited Talk)
- Title not available (Why is that?)
- A correspondence between maximal abelian sub-algebras and linear logic fragments
- Title not available (Why is that?)
- Characterizingco-NLby a group action
- Characterizations of Pushdown Machines in Terms of Time-Bounded Computers
- Title not available (Why is that?)
- Linear logic by levels and bounded time complexity
- Bounded linear logic, revisited
- Reversible space equals deterministic space
- Logic programming and logarithmic space
- Unification and Logarithmic Space
Cited In (5)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4580325)
