Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarPaul Tarau
Person information
- affiliation: University of North Texas, Denton, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
showing all ?? records
2010 – today
- 2018
[j15]Maciej Bendkowski, Katarzyna Grygiel, Paul Tarau:
Random generation of closed simply typed λ-terms: A synergy between logic programming and Boltzmann samplers. TPLP 18(1): 97-119 (2018)- [j14]Alessandro Dal Palù, Paul Tarau:
Introduction to the 34-th international conference on logic programming special issue. TPLP 18(3-4): 296-300 (2018) - [c103]
- [c102]Paul Tarau:
Declarative algorithms for generation, counting and random sampling of term algebras. SAC 2018: 1203-1210 - [e3]Alessandro Dal Palù, Paul Tarau, Neda Saeedloei, Paul Fodor:
Technical Communications of the 34th International Conference on Logic Programming, ICLP 2018, July 14-17, 2018, Oxford, United Kingdom. OASICS 64, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik 2018, ISBN 978-3-95977-090-3 [contents] - 2017
- [c101]Paul Tarau:
A Hitchhiker's Guide to Reinventing a Prolog Machine. ICLP (Technical Communications) 2017: 10:1-10:16 - [c100]Olivier Bodini, Paul Tarau:
On Uniquely Closable and Uniquely Typable Skeletons of Lambda Terms. LOPSTR 2017: 252-268 - [c99]Maciej Bendkowski, Katarzyna Grygiel, Paul Tarau:
Boltzmann Samplers for Closed Simply-Typed Lambda Terms. PADL 2017: 120-135 - [i26]Olivier Bodini, Paul Tarau:
On Uniquely Closable and Uniquely Typable Skeletons of Lambda Terms. CoRR abs/1709.04302 (2017) - 2016
- [c98]Fahmida Hamid, David Haraburda, Paul Tarau:
Evaluating Text Summarization Systems with a Fair Baseline from Multiple Reference Summaries. ECIR 2016: 351-365 - [c97]
- [c96]
- [c95]Paul Tarau:
A Hiking Trip Through the Orders of Magnitude: Deriving Efficient Generators for Closed Simply-Typed Lambda Terms and Normal Forms. LOPSTR 2016: 240-255 - [c94]Paul Tarau:
A Size-Proportionate Bijective Encoding of Lambda Terms as Catalan Objects Endowed with Arithmetic Operations. PADL 2016: 99-116 - [c93]
- [i25]Paul Tarau:
A Hiking Trip Through the Orders of Magnitude: Deriving Efficient Generators for Closed Simply-Typed Lambda Terms and Normal Forms. CoRR abs/1608.03912 (2016) - [i24]Maciej Bendkowski, Katarzyna Grygiel, Paul Tarau:
Random generation of closed simply-typed $λ$-terms: a synergy between logic programming and Boltzmann samplers. CoRR abs/1612.07682 (2016) - 2015
- [c92]Fahmida Hamid, Paul Tarau:
Anti-Summaries: Enhancing Graph-Based Techniques for Summary Extraction with Sentiment Polarity. CICLing (2) 2015: 375-389 - [c91]
- [c90]
- [c89]Paul Tarau:
On Logic Programming Representations of Lambda Terms: de Bruijn Indices, Compression, Type Inference, Combinatorial Generation, Normalization. PADL 2015: 115-131 - [c88]Paul Tarau:
On a uniform representation of combinators, arithmetic, lambda terms and types. PPDP 2015: 244-255 - [c87]
- [c86]Paul Tarau:
On Synergies between Type Inference, Generation and Normalization of SK-Combinator Trees. SYNASC 2015: 160-166 - [i23]Paul Tarau:
A Logic Programming Playground for Lambda Terms, Combinators, Types and Tree-based Arithmetic Computations. CoRR abs/1507.06944 (2015) - 2014
- [j13]Paul Tarau:
Arithmetic and Boolean Operations on Recursively Run-Length Compressed Natural Numbers. Sci. Ann. Comp. Sci. 24(2): 287-323 (2014) - [j12]Paul Tarau:
Towards a generic view of primality through multiset decompositions of natural numbers. Theor. Comput. Sci. 537: 105-124 (2014) - [c85]Paul Tarau:
The Arithmetic of Recursively Run-Length Compressed Natural Numbers. ICTAC 2014: 406-423 - [c84]
- [c83]
- [c82]
- [c81]Paul Tarau:
Bijective Collection Encodings and Boolean Operations with Hereditarily Binary Natural Numbers. PPDP 2014: 31-42 - [c80]Paul Tarau, Bill P. Buckles:
Arithmetic algorithms for hereditarily binary natural numbers. SAC 2014: 1593-1600 - [c79]
- [i22]
- [i21]Paul Tarau:
A Generic Numbering System based on Catalan Families of Combinatorial Objects. CoRR abs/1406.1796 (2014) - 2013
- [j11]David Haraburda, Paul Tarau:
Binary trees as a computational framework. Computer Languages, Systems & Structures 39(4): 163-181 (2013) - [j10]Paul Tarau:
Compact serialization of Prolog terms (with catalan skeletons, cantor tupling and Gödel numberings). TPLP 13(4-5): 847-861 (2013) - [c78]
- [i20]Paul Tarau:
Tree-based Arithmetic and Compressed Representations of Giant Numbers. CoRR abs/1301.0114 (2013) - [i19]
- [i18]
- [i17]Paul Tarau:
Arithmetic Algorithms for Hereditarily Binary Natural Numbers. CoRR abs/1306.1128 (2013) - [i16]
- 2012
- [j9]Paul Tarau:
The BinProlog experience: Architecture and implementation choices for continuation passing Prolog and first-class logic engines. TPLP 12(1-2): 97-126 (2012) - [c77]Paul Tarau:
Deriving a Fast Inverse of the Generalized Cantor N-tupling Bijection. ICLP (Technical Communications) 2012: 312-322 - [c76]Paul Tarau:
A Declarative Specification of Tree-Based Symbolic Arithmetic Computations. PADL 2012: 273-288 - [c75]Paul Tarau, Arun K. Majumdar, Paulo Moura:
Agent spaces: a scalable architecture for distributed logic agents. RACS 2012: 263-268 - [c74]Paul Tarau, Brenda Luderman:
Symbolic modeling of a universal reconfigurable logic gate and its applications to circuit synthesis. RACS 2012: 389-394 - [c73]
- [c72]
- [c71]Paul Tarau, Brenda Luderman:
Boolean Evaluation with a Pairing and Unpairing Function. SYNASC 2012: 384-390 - 2011
- [c70]
- [c69]Paul Tarau:
Emulating Primality with Multiset Representations of Natural Numbers. ICTAC 2011: 218-238 - [c68]Paul Tarau:
Integrated symbol table, engine and heap memory management in multi-engine prolog. ISMM 2011: 129-138 - [c67]Paul Tarau:
Concurrent programming constructs in multi-engine prolog: parallelism just for the cores (and not more!). DAMP 2011: 55-64 - [i15]Paul Tarau:
The BinProlog Experience: Architecture and Implementation Choices for Continuation Passing Prolog and First-Class Logic Engines. CoRR abs/1102.1178 (2011) - [i14]
- [i13]
- 2010
- [j8]Paul Tarau:
"Everything Is Everything" Revisited: Shapeshifting Data Types with Isomorphisms and Hylomorphisms. Complex Systems 18(4) (2010) - [c66]Paul Tarau:
A Unified Formal Description of Arithmetic and Set Theoretical Data Types. AISC/MKM/Calculemus 2010: 247-261 - [c65]Paul Tarau:
Hereditarily Finite Representations of Natural Numbers and Self-Delimiting Codes. MSFP@ICFP 2010: 11-18 - [c64]Paul Tarau:
On Arithmetic Computations with Hereditarily Finite Sets, Functions and Types. ICTAC 2010: 367-381 - [c63]
- [i12]Paul Tarau:
A Unified Formal Description of Arithmetic and Set Theoretical Data Types. CoRR abs/1006.5768 (2010)
2000 – 2009
- 2009
- [c62]
- [c61]
- [c60]
- [c59]Paul Tarau:
Isomorphisms, hylomorphisms and hereditarily finite data types in Haskell. SAC 2009: 1898-1902 - 2008
- [c58]Paul Tarau, Brenda Luderman:
Exact combinational logic synthesis and non-standard circuit design. Conf. Computing Frontiers 2008: 179-188 - [c57]
- [c56]
- [i11]Paul Tarau, Brenda Luderman:
A Logic Programming Framework for Combinational Circuit Synthesis. CoRR abs/0804.2095 (2008) - [i10]
- [i9]Paul Tarau:
Ranking and Unranking of Hereditarily Finite Functions and Permutations. CoRR abs/0808.0554 (2008) - [i8]Paul Tarau:
Pairing Functions, Boolean Evaluation and Binary Decision Diagrams. CoRR abs/0808.0555 (2008) - [i7]
- [i6]Paul Tarau:
Ranking Catamorphisms and Unranking Anamorphisms on Hereditarily Finite Datatypes. CoRR abs/0808.0753 (2008) - [i5]Paul Tarau:
A Functional Hitchhiker's Guide to Hereditarily Finite Sets, Ackermann Encodings and Pairing Functions. CoRR abs/0808.0754 (2008) - [i4]Paul Tarau:
Declarative Combinatorics: Boolean Functions, Circuit Synthesis and BDDs in Haskell. CoRR abs/0808.0760 (2008) - [i3]Paul Tarau:
Declarative Combinatorics: Isomorphisms, Hylomorphisms and Hereditarily Finite Data Types in Haskell. CoRR abs/0808.2953 (2008) - 2007
- [c55]Paul Tarau, Brenda Luderman:
A Logic Programming Framework for Combinational Circuit Synthesis. ICLP 2007: 180-194 - 2005
- [c54]Andy Borman, Rada Mihalcea, Paul Tarau:
PicNet: Augmenting Semantic Resources with Pictorial Representations. AAAI Spring Symposium: Knowledge Collection from Volunteer Contributors 2005: 1-7 - [c53]Rada Mihalcea, Paul Tarau:
A Language Independent Algorithm for Single and Multiple Document Summarization. IJCNLP (companion) 2005 - [c52]David Hurt, Paul Tarau:
An empirical evaluation of communication effectiveness in autonomous reactive multiagent systems. SAC 2005: 74-78 - [c51]Paul Tarau, Rada Mihalcea, Elizabeth Figa:
Semantic document engineering with WordNet and PageRank. SAC 2005: 782-786 - [c50]
- 2004
- [c49]Elizabeth Figa, Paul Tarau, Jesse Ephraim:
Enhancing the virtual storytelling experience with metadata driven voice enabled conversational agents. ASIST 2004: 403-410 - [c48]Rada Mihalcea, Paul Tarau, Elizabeth Figa:
PageRank on Semantic Networks, with Application to Word Sense Disambiguation. COLING 2004 - [c47]
- [c46]Elizabeth Figa, Paul Tarau:
Conversational Agents as Web Services. International Conference on Internet Computing 2004: 773-782 - [c45]
- [c44]Paul Tarau, Elizabeth Figa:
Knowledge-based conversational agents and virtual storytelling. SAC 2004: 39-44 - [i2]Paul Tarau, Verónica Dahl:
High-Level Networking With Mobile Code And First Order AND-Continuations. CoRR cs.PL/0405088 (2004) - 2003
- [c43]Elizabeth Figa, Paul Tarau:
Lexical inference mechanisms for text understanding and classification. ASIST 2003: 165-173 - [c42]Qinan Zhou, Paul Tarau:
Garbage Collection Algorithms for Java-Based Prolog Engines. PADL 2003: 304-319 - 2001
- [j7]Paul Tarau, Verónica Dahl:
High-Level Networking with Mobile Code and First Order AND-Continuations. TPLP 1(3): 359-380 (2001) - [c41]
- [c40]Anima Gupta, Paul Tarau:
Logic Programming Techniques for Dynamic VRML Web Content Generation. PADL 2001: 93-107 - [c39]Satyam Tyagi, Paul Tarau:
A Most Specific Method Finding Algorithm for Reflection Based Dynamic Prolog-to-Java Interfaces. PADL 2001: 322-336 - 2000
- [c38]Paul Tarau:
Fluents: A Refactoring of Prolog for Uniform Reflection an Interoperation with External Objects. Computational Logic 2000: 1225-1239
1990 – 1999
- 1999
- [j6]Verónica Dahl, Stephen Rochefort, Marius Scurtescu, Paul Tarau:
A Spanish Interface To LogiMoo: Towards Multilingual Virtual Worlds. Informatica (Slovenia) 23(4) (1999) - [j5]Paul Tarau, Koenraad De Bosschere, Verónica Dahl, Stephen Rochefort:
LogiMOO: An Extensible Multi-user Virtual World with Natural Language Control. J. Log. Program. 38(3): 331-353 (1999) - [j4]
- [p1]Paul Tarau, Verónica Dahl:
Towards a Logic Programming Infrastructure for Internet Programming. Artificial Intelligence Today 1999: 431-457 - 1998
- [c37]Paul Tarau, Verónica Dahl:
Code Migration with First Order Continuations. APPIA-GULP-PRODE 1998: 215-226 - [c36]Paul Tarau, Verónica Dahl, Koen De Bosschere:
Towards Logic Programming Based Coordination in Virtual Worlds. HICSS (7) 1998: 236-244 - [c35]Paul Tarau:
Jinni: a Lightweight Java-based Logic Engine for Internet Programming. Implementation Technology for Programming Languages based on Logic 1998: 1-15 - [c34]
- 1997
- [j3]Paul Tarau, Koenraad De Bosschere, Bart Demoen:
On Delphi Lemmas and other Memoing Techniques for Deterministic Logic Programs. J. Log. Program. 30(2): 145-163 (1997) - [c33]Paul Tarau, Verónica Dahl, Stephen Rochefort, Koenraad De Bosschere:
LogiMOO: A Multi-User Virtual World with Agents and Natural Language Programming. CHI Extended Abstracts 1997: 323-324 - [c32]Verónica Dahl, Paul Tarau, Renwei Li:
Assumption Grammars for Processing Natural Language. ICLP 1997: 256-270 - [c31]Osma R. Zaine, Andrew Fall, Stephen Rochefort, Verónica Dahl, Paul Tarau:
On-Une Resource Discovery Using Natural Language. RIAO 1997: 336-356 - [c30]
- [c29]Paul Tarau, Verónica Dahl, Koenraad De Bosschere:
A Logic Programming Infrastructure for Remote Execution, Mobile Code and Agents. WETICE 1997: 106-112 - 1996
- [j2]Paul Tarau, Koenraad De Bosschere, Bart Demoen:
Partial Translation: Towards a Portable and Efficient Prolog Implementation Technology. J. Log. Program. 29(1-3): 65-83 (1996) - [j1]Koenraad De Bosschere, Paul Tarau:
Blackboard-based Extensions in Prolog. Softw., Pract. Exper. 26(1): 49-69 (1996) - [c28]Paul Tarau, Verónica Dahl, Koenraad De Bosschere:
Towards Logic Programming Based Coordination in Virtual Worlds. Coordination Technology for Collaborative Applications 1996: 49-62 - [c27]Paul Tarau, Verónica Dahl, Andrew Fall:
Backtrackable State with Linear Affine Implication and Assumption Grammars. ASIAN 1996: 53-63 - [c26]Verónica Dahl, Andrew Fall, Stephen Rochefort, Paul Tarau:
A Hypothetical Reasoning-based Framework for NL Processing. ICTAI 1996: 67-70 - [c25]Bart Demoen, Geert Engels, Paul Tarau:
Segment order preserving copying garbage collection for WAM based Prolog. SAC 1996: 380-386 - 1995
- [c24]
- [c23]
- [c22]Paul Tarau, Bart Demoen, Koenraad De Bosschere:
The power of partial tanslation: an experiment with the C-ification of binary Prolog. SAC 1995: 152-156 - [c21]
- [c20]Paul Tarau, Verónica Dahl, Andrew Fall:
Backtrackable State with Linear Assumptions, Continuations and Hidden Accumulator Grammars. ILPS 1995: 642 - [i1]Verónica Dahl, Paul Tarau, Lidia Moreno, Manuel Palomar:
Treating Coordination with Datalog Grammars. CoRR cmp-lg/9505006 (1995) - 1994
- [c19]
- [c18]
- [c17]Paul Tarau:
Low-level issues in implementing a high-performance continuation passing Binary Prolog engine. JFPLC 1994: 287- - [c16]Paul Tarau, Verónica Dahl:
Logic Programming and Logic Grammars with First-Order Continuations. LOPSTR 1994: 215-230 - [c15]Paul Tarau, Ulrich Neumerkel:
A Novel Term Compression Scheme and Data Representation in the BinWAM. PLILP 1994: 73-87 - [c14]Koenraad De Bosschere, Paul Tarau:
High performance continuation passing style Prolog-to-C mapping. SAC 1994: 383-387