William W. Wadge

Affiliations:
  • University of Victoria, Canada


According to our database1, William W. Wadge authored at least 50 papers between 1974 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
The Dimensional Analysis of Data Flow Programs That Include Multidimensional and User-Defined Functions.
Proceedings of the IEEE International Conference on Big Data, 2022

2015
Multidimensional infinite data in the language Lucid.
Math. Struct. Comput. Sci., 2015

2013
Extensional Higher-Order Logic Programming.
ACM Trans. Comput. Log., 2013

2009
Strong equivalence of logic programs under the infinite-valued semantics.
Inf. Process. Lett., 2009

Harnessing the power of "favorites" lists for recommendation systems.
Proceedings of the 2009 ACM Conference on Recommender Systems, 2009

Preferential Infinitesimals for Information Retrieval.
Proceedings of the Artificial Intelligence Applications and Innovations III, 2009

Trust-Based Infinitesimals for Enhanced Collaborative Filtering.
Proceedings of the 15th International Conference on Management of Data, 2009

2008
Preferential Regular Path Queries.
Fundam. Informaticae, 2008

An infinite-game semantics for well-founded negation in logic programming.
Ann. Pure Appl. Log., 2008

08271 Executive Summary - Topological and Game-Theoretic Aspects of Infinite Computations.
Proceedings of the Topological and Game-Theoretic Aspects of Infinite Computations, 29.06., 2008

08271 Abstracts Collection - Topological and Game-Theoretic Aspects of Infinite Computations.
Proceedings of the Topological and Game-Theoretic Aspects of Infinite Computations, 29.06., 2008

General Logic Programs as Infinite Games.
Proceedings of the Topological and Game-Theoretic Aspects of Infinite Computations, 29.06., 2008

Sequential Demand-Driven Evaluation of Eager TransLucid.
Proceedings of the 32nd Annual IEEE International Computer Software and Applications Conference, 2008

2007
A Purely Model-Theoretic Semantics for Disjunctive Logic Programs with Negation.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2007

Preferentially Annotated Regular Path Queries.
Proceedings of the Database Theory, 2007

2005
Minimum model semantics for logic programs with negation-as-failure.
ACM Trans. Comput. Log., 2005

The Lazy Evaluation of Infinitesimal Logic Expressions.
Proceedings of The 2005 International Conference on Programming Languages and Compilers, 2005

A Sufficient Condition for Strong Equivalence Under the Well-Founded Semantics.
Proceedings of the Logic Programming, 21st International Conference, 2005

An infinite-game semantics for negation in logic programming.
Proceedings of the 1st Workshop on Games for Logic and Programming Languages, 2005

2004
An Intensional Tool Applied to French Language Educational Software.
Proceedings of the Sixteenth International Conference on Software Engineering & Knowledge Engineering (SEKE'2004), 2004

2002
An Infinite-Valued Semantics for Logic Programs with Negation.
Proceedings of the Logics in Artificial Intelligence, European Conference, 2002

"The Medium" Is the Message.
Proceedings of the Distributed Communities on the Web, 4th International Workshop, 2002

2001
A Complementary Approach for Adaptive and Adaptable Hypermedia: Intensional Hypertext.
Proceedings of the Hypermedia: Openness, 2001

2000
Intensional Markup Language.
Proceedings of the Distributed Communities on the Web, Third International Workshop, 2000

1999
Higher-Order Functional Languages and Intensional Logic.
J. Funct. Program., 1999

1998
Intensional HTML.
Proceedings of the Principles of Digital Document Processing, 4th International Workshop, 1998

1997
First-Order Functional Languages and Intensional Logic.
J. Funct. Program., 1997

1994
Extending Temporal Logic Programming with Choice Predicates Non-Determinism.
J. Log. Comput., 1994

Higher-order dataflow and its implementation on stock hardware.
Proceedings of the 1994 ACM Symposium on Applied Computing, 1994

Compiling Higher-Order Functions for Tagged-Dataflow.
Proceedings of the Parallel Architectures and Compilation Techniques, 1994

1993
A New Approach to Version Control.
IEEE Trans. Software Eng., 1993

A Unix Tool for Managing Reusable Software Components.
Softw. Pract. Exp., 1993

Chronolog (Z): Linear-Time Logic Programming.
Proceedings of the Computing and Information, 1993

1992
Towards a Unified Theory of Intensional Logic Programming.
J. Log. Program., 1992

A Relational Algebra as a Query Language for Temporal DATALOG.
Proceedings of the International Conference on Database and Expert Systems Applications, 1992

1991
Higher-Order Horn Logic Programming.
Proceedings of the Logic Programming, Proceedings of the 1991 International Symposium, San Diego, California, USA, Oct. 28, 1991

1990
The Eductive Implementation of a Three-dimensional Spreadsheet.
Softw. Pract. Exp., 1990

A 3D Spreadsheet Based on Intensional Logic.
IEEE Softw., 1990

1988
An intentional language as the basis of a 3-D spreadsheet design.
Proceedings of the 1988 Internation Conference on Computer Languages, 1988

1987
An eductive interpreter for Lucid.
Proceedings of the Symposium on Interpreters and Interpretive Techniques, 1987, St. Paul, Minnesota, USA, June 24, 1987

1982
R/ for Semantics.
ACM Trans. Program. Lang. Syst., 1982

1981
An Extensional Treatment of Dataflow Deadlock.
Theor. Comput. Sci., 1981

1980
Some common misconceptions about Lucid.
ACM SIGPLAN Notices, 1980

1978
Clauses: Scope Structures and Defined Functions in Lucid.
Proceedings of the Conference Record of the Fifth Annual ACM Symposium on Principles of Programming Languages, 1978

1977
Erratum: Lucid - A Formal System for Writing and Proving Programs.
SIAM J. Comput., 1977

Lucid, a Nonprocedural Language with Iteration.
Commun. ACM, 1977

Intermittent Assertion Proofs in Lucid.
Proceedings of the Information Processing, 1977

Data Types as Objects.
Proceedings of the Automata, 1977

1976
Lucid - A Formal System for Writing and Proving Programs.
SIAM J. Comput., 1976

1974
Normal Form Reduction of Probabilistic Computations in Non-Parametric Classification.
Comput. J., 1974


  Loading...