#### Filter Results:

- Full text PDF available (36)

#### Publication Year

1974

2015

- This year (0)
- Last 5 years (2)
- Last 10 years (15)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Edward A. Ashcroft, William W. Wadge
- Commun. ACM
- 1977

Lucid is a formal system in which programs can be written and proofs of programs carried out. The proofs are particularly easy to follow and straightforward to produce because the statements in a Lucid program are simply axioms from which the proof proceeds by (almost) conventional logical reasoning, with the help of a few axioms and rules of inference for… (More)

- Edward A. Ashcroft, William W. Wadge
- SIAM J. Comput.
- 1976

Lucid is both a programming language and a formal system for proving properties of Lucid programs. The programming language is unconventional in many ways, although programs are readily understood as using assignment statements and loops in a "structured" fashion. Semantically, an assignment statement is really an equation between "histories", and a whole… (More)

Chronolog(Z) is a logic programming language based on a linear-time temporal logic with unbounded past and future. It is suitable for applications involving the notion of dynamic change such as modelling periodical changes, non-terminating computations and temporal databases. The declarative semantics of Chronolog(Z) programs are given in terms of temporal… (More)

- William W. Wadge
- ISLP
- 1991

We describe a fragment of higher-order Horn logic which can be used as a higher-order extension of Prolog. It allows the programmer to axiomatize predicates of predicates and operations on predicates. The restrictions defining the fragment ensure that the higher-order predicates and operations defined are monotonic and continuous—that they are enumeration… (More)

- Panos Rondogiannis, William W. Wadge
- ACM Trans. Comput. Log.
- 2005

We give a purely model-theoretic characterization of the semantics of logic programs with negation-as-failure allowed in clause bodies. In our semantics, the meaning of a program is, as in the classical case, the unique <i>minimum</i> model in a program-independent ordering. We use an expanded truth domain that has an uncountable linearly ordered set of… (More)

- Antony A. Faustini, William W. Wadge
- PLDI
- 1987

We describe an interpreter for pLucid, a member of the Lucid family of functional dataflow languages. In appearance, pLucid is similar to Landin's Iswim, exept that individual variables and expressions denote <i>streams</i> (infinite sequences of data items), and function variables denote <i>filters</i> (stream-to-stream transformations). The actual data… (More)

- John Plaice, William W. Wadge
- IEEE Trans. Software Eng.
- 1993

We present a new approach to the control of versions of software and other hierarchically structured entities. Any part of a system, from the smallest component to a complete system, may exist in different versions. The set of all possible versions under the refinement relation forms a partial order (in fact, a lattice). The fact that version V approximates… (More)

- Panos Rondogiannis, William W. Wadge
- J. Funct. Program.
- 1997

The purpose of this paper is to demonstrate that rst-order functional programs can be transformed into intensional programs of nullary variables, in a semantics preserving way. On the foundational side, the goal of our study is to bring new insights and a better understanding of the nature of functional languages. From a practical point of view, our… (More)

Intensional HTML is a high-level Web authoring language that makes practical (using standard client and server software) the speci cation of pages and sites that exist in many di erent versions or variants. Each page of IHTML de nes an intension | an indexed family of actual (extensional) HTML pages which varies over a multi-dimensional author-speci ed… (More)

- Maria Chowdhury, Alex Thomo, William W. Wadge
- COMAD
- 2009

In this paper we propose a novel recommender system which enhances user-based collaborative filtering by using a trust-based social network. Our main idea is to use infinitesimal numbers and polynomials for capturing natural preferences in aggregating opinions of trusted users. We use these opinions to “help” users who are similar to an active user to come… (More)