The following pages link to Paul Tarau (Q461477):
Displaying 32 items.
- Binary trees as a computational framework (Q461478) (← links)
- On uniquely closable and uniquely typable skeletons of lambda terms (Q1671157) (← links)
- Synthesis of modality definitions and a theorem prover for epistemic intuitionistic logic (Q2119125) (← links)
- A hiking trip through the orders of magnitude: deriving efficient generators for closed simply-typed lambda terms and normal forms (Q2409739) (← links)
- Towards a generic view of primality through multiset decompositions of natural numbers (Q2453539) (← links)
- (Q2767141) (← links)
- (Q2771909) (← links)
- The BinProlog experience: Architecture and implementation choices for continuation passing Prolog and first-class logic engines (Q2893093) (← links)
- The Arithmetic of Recursively Run-Length Compressed Natural Numbers (Q2938176) (← links)
- Emulating Primality with Multiset Representations of Natural Numbers (Q3105752) (← links)
- Ranking/Unranking of Lambda Terms with Compressed de Bruijn Indices (Q3453110) (← links)
- A Unified Formal Description of Arithmetic and Set Theoretical Data Types (Q3582712) (← links)
- (Q3584061) (← links)
- On Arithmetic Computations with Hereditarily Finite Sets, Functions and Types (Q3585061) (← links)
- A Logic Programming Framework for Combinational Circuit Synthesis (Q3608655) (← links)
- A Groupoid of Isomorphic Data Transformations (Q3637276) (← links)
- (Q4237023) (← links)
- Partial translation: towards a portable and efficient prolog implementation technology (Q4345907) (← links)
- On Delphi lemmas and other memoing techniques for deterministic logic programs (Q4365059) (← links)
- (Q4415116) (← links)
- (Q4499256) (← links)
- Random generation of closed simply typed λ-terms: A synergy between logic programming and Boltzmann samplers (Q4603430) (← links)
- Arithmetic and Boolean Operations on Recursively Run-Length Compressed Natural Numbers (Q4621184) (← links)
- LogiMOO: An extensible multi-user virtual world with natural language control (Q4719368) (← links)
- Deriving Efficient Sequential and Parallel Generators for Closed Simply-Typed Lambda Terms and Normal Forms (Q4988930) (← links)
- (Q5020559) (← links)
- (Q5020970) (← links)
- Abductive Reasoning in Intuitionistic Propositional Logic via Theorem Synthesis (Q5038472) (← links)
- Deriving a Fast Inverse of the Generalized Cantor N-tupling Bijection (Q5398069) (← links)
- Compact serialization of Prolog terms (with catalan skeletons, cantor tupling and Gödel numberings) (Q5398315) (← links)
- Computing with Catalan Families (Q5404944) (← links)
- (Q6142036) (← links)