## Implicit Programming and the Logic of Constructible Duality (1998)

Citations: | 1 - 0 self |

### BibTeX

@MISC{Patterson98implicitprogramming,

author = {Anna L. Patterson},

title = {Implicit Programming and the Logic of Constructible Duality},

year = {1998}

}

### OpenURL

### Abstract

We present an investigation of duality in the traditional logical manner. We extend Nelson's symmetrization of intuitionistic logic, constructible falsity, to a self-dual logic-- constructible duality. We develop a self-dual model by considering an interval of worlds in an intuitionistic Kripke model. The duality arises through how we judge truth and falsity. Truth is judged forward in the Kripke model, as in intuitionistic logic, while falsity is judged backwards. We develop a self-dual algebra such that every point in the algebra is representable by some formula in the logic. This algebra arises as an instantiation of a Heyting algebra into several categorical constructions. In particular, we show that this algebra is an instantiation of the Chu construction applied to a Heyting algebra, the second Dialectica construction applied to a Heyting algebra, and as an algebra for the study of recursion and corecursion. Thus the algebra provides a common base for these constructions, and suggests itself as an important part of any constructive logical treatment of duality. Implicit programming is suggested as a new paradigm for computing with constructible duality as its formal system. We show that all the operators that have computable least fixed points are definable explicitly and all operators with computable optimal fixed points are definable implicitly within constructible duality. Implicit programming adds a novel definitional mechanism that allows functions to be defined implicitly. This new programming feature is especially useful for programming with co-recursively defined data-types such as circular lists.

### Citations

601 |
A Mathematical Introduction to Logic
- Enderton
- 1972
(Show Context)
Citation Context ... Boolean logic's model theory and then present an overview of the differences between this model theory and intuitionistic model theory. The model theory for propositional Boolean logic is well known(=-=Enderton 1972-=-). It is founded on the idea of a valuation function. A model of Boolean logic using a set of propositional atoms is a function from P to the set containing "true" and "false" called a valuation 25sfu... |

381 | Bilattices and the semantics of logic programming
- Fitting
- 1991
(Show Context)
Citation Context ... if \Gamma i ae \Gamma j, and 3. p 2 Vk(\Gamma i ) \Delta i) if and only if p 2 \Gamma i. Note: Item 2 builds the monotonicity condition into Rk and also implies that \Delta j ae \Delta i. Theorem 7 (=-=Fitting 1991-=-) If \Gammas) \Deltasis a complete sequent in Ip then in K, \Gammas) \Deltas6j=K \Gammas) \Delta . The proof of this theorem relies on the notion of saturatedness. With these definitions and lemmas ma... |

282 | Computational Interpretations of Linear Logic - Abramsky - 1993 |

202 | A Basis for a Mathematical Theory of Computation - McCarthy - 1963 |

201 | Non-Well-Founded Sets - Aczel - 1988 |

170 |
N.: Elementary induction on abstract structures. North
- Moschovakis
- 1974
(Show Context)
Citation Context ...3, Milner and Tofte 1991, Pitts 1994, Gordon 1995). 119s7.1 Fixed Points Many programming languages are naturally characterized in terms of the least fixed point of a recursive operator (Kleene 1959, =-=Moschovakis 1974-=-, Moschovakis 1977, Cutland 1980). Consider the simple example of the factorial function. f (0) = 1 f (n + 1) = (n + 1) \Lambdasf (n) This is a recursive definition of the factorial function. We can m... |

162 | Basic Proof Theory
- Troelstra, Schwichtenberg
- 2000
(Show Context)
Citation Context ...a u such that s1R\Lambda u and s2R\Lambda u where R\Lambdasis the reflexive transitive closure of R. 2.8.2.1 Confluent and Strongly Normalizing These two lemmas are standard and can be found in c.f. (=-=Troelstra and Schwichtenberg 1996-=-) pg. 11. Lemma 33 For a confluent reduction relation B, the normal forms of terms are unique. Furthermore, if B is a confluent reduction relation then we have: t =B t0 () there is a term s such that ... |

132 |
Towards a mathematical semantics for computer languages
- Scott, Strachey
- 1971
(Show Context)
Citation Context ...terms of bisimulation. 7.8 Conclusion Programs are naturally represented using recursive definitions of functions (McCarthy 1963a). These sets of equations can be given a least fixed point semantics (=-=Scott and Strachey 1971-=-). Least fixed point semantics suggest that a function should be undefined as often as possible. Another possible semantics is the optimal fixed point (Manna and Shamir 1977). This suggests that if a ... |

124 |
Metamathematical Investigations of Intuitionistic Arithmetic and Analysis
- Troelstra
- 1973
(Show Context)
Citation Context ...-De Bruijn isomorphism states that proof normalization in propositional intuitionistic logic is isomorphic to reductions in the typed lambda calculus. This has been extended to Heyting arithmetic in (=-=Troelstra 1973-=-). We consider an extension of this isomorphism to constructible duality. We use the logic of constructible duality in positive normal form and give an assignment of terms in a lambda calculus to proo... |

121 |
Bisimilarity as a theory of functional programming
- Gordon
- 1999
(Show Context)
Citation Context ...ams are very natural for functions whose domains include co-recursively defined data-structures (Barwise and Moss 1996, Fiore 1996, Moss and Danner 1996, Park 1983, Milner and Tofte 1991, Pitts 1994, =-=Gordon 1995-=-). 119s7.1 Fixed Points Many programming languages are naturally characterized in terms of the least fixed point of a recursive operator (Kleene 1959, Moschovakis 1974, Moschovakis 1977, Cutland 1980)... |

119 |
Computability: An Introduction to Recursive Function Theory
- Cutland
- 1986
(Show Context)
Citation Context ...ction to be the least fixed point of a recursive operator. The key insight that makes recursive programs useful is that this least fixed point is always computable, for a good introductory text c.f. (=-=Cutland 1980-=-). As is familiar in mathematics, functions can be defined by giving equations that the function satisfies. A popular example of this is the factorial function. f (n + 1) = (n + 1) \Lambdasf (n); f (0... |

91 | The mathematical language AUTOMATH, its usage, and some of its extensions - Bruijn - 1968 |

74 |
An Algebraic Approach to Non-Classical Logics
- Rasiowa
- 1974
(Show Context)
Citation Context ...itions. This means that the congruence relation for the algebra of N can be made from ' jsand :' j :, where ' jsmeans that from the truth of ' you can prove the truth of , i.e. ' oe , and vice versa (=-=Rasiowa 1974-=-, Vakarelov 1977). The algebra for N was first constructed by (Rasiowa 1974), who called it a quasi-pseudo boolean algebra, later dubbed N -lattices after Nelson. Later authors viewed this as a set of... |

73 | New foundations for the geometry of interaction - Abramsky, Jagadeesan - 1994 |

68 |
Recursive types reduced to induct,ive types
- Freyd
- 1990
(Show Context)
Citation Context ...the dialectica (de Paiva 1989a) (de Paiva 1989b) (de Paiva and Hyland 1993) categories, toposes (Klunder 1992) and special final coalgebra (Barwise and Moss 1996) (Pitts 1994) (Moss and Danner 1996) (=-=Freyd 1990-=-, Fiore 1996) constructions. Chu spaces (Pratt 1995, Gupta 1994) have been studied as models of computation because they can describe topologies, event structures (Nielsen et al. 1981) (Glabbeek and P... |

58 |
Linear logic. Theoretical Computer Science, 50:1– 102. Vulnerability, Complexity and Variation in Language Acquisition 19
- Girard
- 1987
(Show Context)
Citation Context ...l opposites play an increasing role in our understanding of fundamental structural properties of computation and have come to the forefront of logical investigations in computer science. Linear logic(=-=Girard 1987-=-), Co-recursion(Pitts 1994), the _-calculus(Kozen 1983, Pratt 1980), and self-dual categories(Barr 1979, Pratt 1995) have attracted much attention. Here we consider many of these same structures, but ... |

54 |
Topological representation of distributive lattices and Brouwerian logic, Čas. mat. fys
- Stone
- 1937
(Show Context)
Citation Context ...two copies of a Heyting algebra, one order reversed, producted together. Thus it clearly contains two copies of intuitionistic logic (or a copy of intuitionistic logic and a copy of Brouwerian logic (=-=Stone 1937-=-)). We now show how these two copies can be extracted from constructible duality. Then we consider Girard's linear logic and in particular we discuss its exponentials which will be the tools that carr... |

49 |
Chu Spaces: A Model of Concurrency
- Gupta
- 1994
(Show Context)
Citation Context ...Hyland 1993) categories, toposes (Klunder 1992) and special final coalgebra (Barwise and Moss 1996) (Pitts 1994) (Moss and Danner 1996) (Freyd 1990, Fiore 1996) constructions. Chu spaces (Pratt 1995, =-=Gupta 1994-=-) have been studied as models of computation because they can describe topologies, event structures (Nielsen et al. 1981) (Glabbeek and Plotkin 1995), other models of concurrency and a model of linear... |

40 | A co-inducion principle for recursively defined domains
- Pitts
- 1994
(Show Context)
Citation Context ...ing role in our understanding of fundamental structural properties of computation and have come to the forefront of logical investigations in computer science. Linear logic(Girard 1987), Co-recursion(=-=Pitts 1994-=-), the _-calculus(Kozen 1983, Pratt 1980), and self-dual categories(Barr 1979, Pratt 1995) have attracted much attention. Here we consider many of these same structures, but we started from a logical ... |

39 | Lectures on Linear Logic - Troelstra - 1992 |

37 | A coinduction principle for recursive data types based on bisimulation
- Fiore
- 1996
(Show Context)
Citation Context ...ca (de Paiva 1989a) (de Paiva 1989b) (de Paiva and Hyland 1993) categories, toposes (Klunder 1992) and special final coalgebra (Barwise and Moss 1996) (Pitts 1994) (Moss and Danner 1996) (Freyd 1990, =-=Fiore 1996-=-) constructions. Chu spaces (Pratt 1995, Gupta 1994) have been studied as models of computation because they can describe topologies, event structures (Nielsen et al. 1981) (Glabbeek and Plotkin 1995)... |

31 |
Concurrency and Communication
- Milner
- 1988
(Show Context)
Citation Context ...ntain loops. Two cyclic lists however are not equal, even to themselves, by the least fixed point of equal. Another possibility is to consider a different equivalence relation on lists: bisimilarity (=-=Milner 1989-=-) (Barwise and Moss 1996). The notion of defining data-types corecursively has been considered by many researchers (Gordon 1994, Gordon 1995, Pitts 1994, Freyd 1990). When data-types are defined co-re... |

30 | Zur Deutung der Intuitionistischen Logik - Kolmogorov - 1932 |

30 | The Stone gamut: A coordinatization of mathematics
- Pratt
- 1995
(Show Context)
Citation Context ...e come to the forefront of logical investigations in computer science. Linear logic(Girard 1987), Co-recursion(Pitts 1994), the _-calculus(Kozen 1983, Pratt 1980), and self-dual categories(Barr 1979, =-=Pratt 1995-=-) have attracted much attention. Here we consider many of these same structures, but we started from a logical perspective, where duality appears in the form of an operator, constructive negation and ... |

27 | A dialectica-like model of linear logic - Paiva - 1989 |

27 | A tutorial on co-induction and functional programming
- Gordon
- 1994
(Show Context)
Citation Context ... is to consider a different equivalence relation on lists: bisimilarity (Milner 1989) (Barwise and Moss 1996). The notion of defining data-types corecursively has been considered by many researchers (=-=Gordon 1994-=-, Gordon 1995, Pitts 1994, Freyd 1990). When data-types are defined co-recursively, bisimilarity is the notion of identity that is used. Bisimilarity is the equivalence notion given by the greatest fi... |

25 |
Theory of Deductive Systems and Its Applications
- Maslov
- 1987
(Show Context)
Citation Context ...hat captures the positive information (the 9 translation), and another that captures the negative information (the 8 translation). By reducing the Kleene normal form via a Maslov-style transformation(=-=Maslov 1987-=-), it suffices to define the translation for equations which have function calls at nesting depth two. We define a recursive operator over these sets of recursive equations. We align the notions of op... |

22 | The Dialectica categories - Paiva - 1987 |

22 | Event Spaces and Their Linear Logic - Pratt - 1991 |

20 |
Gentzen-type systems and resolution rules
- Mints
(Show Context)
Citation Context ...rule for 0 where 0 represents falsity. In this logic ^ distributes over . and . distributes over ^. That is we have a . (b ^ c) j (a . b) ^ (a . c) and also a ^ (b . c) j (a ^ b) . (a ^ c). 19sMints (=-=Mints 1990-=-) proved using realizability that these three systems were all equivalent. Gentzen (Gentzen 1969) proved that the Hilbert rules were equivalent to his single-occurrence Gentzen rules and he also prove... |

20 |
The ‘fairness’ problem and nondeterministic computing networks
- Park
- 1983
(Show Context)
Citation Context ... circular lists. Implicit definitions of programs are very natural for functions whose domains include co-recursively defined data-structures (Barwise and Moss 1996, Fiore 1996, Moss and Danner 1996, =-=Park 1983-=-, Milner and Tofte 1991, Pitts 1994, Gordon 1995). 119s7.1 Fixed Points Many programming languages are naturally characterized in terms of the least fixed point of a recursive operator (Kleene 1959, M... |

19 |
Intuitionistic Logic with Strong Negation
- Gurevich
- 1977
(Show Context)
Citation Context ...denoted N . Earlier, Thomason (Thomason 1969) proposed an ordering on worlds with three truth values true, false and undecided for which he shows that N is sound and complete, c.f. similar models by (=-=Gurevich 1977-=-, Routley 1975). Models with multiple viewpoints are used in relevant logics to avoid the rule of weakening c.f. (Hautam"aki 1982) for a generalization. We give an ordering on worlds having only two t... |

18 | Simplified Semantics for Relevant Logics (and Some of Their Rivals
- Restall
- 1993
(Show Context)
Citation Context ...if ' is already valid thensis not relevant to proving '. Since we are mainly focusing on certain similarities between the models we present the \Lambdasmodels of relevance logic following (Dunn 1986, =-=Restall 1995-=-). Definition 112 A \LambdasModel A relevant model RM = hw\Lambda ; W; R; V; \Lambda i over a set of atoms P is a set W , a distinguished start world w\Lambdas2 W , a ternary relation R ` W \ThetasW \... |

17 | The Duality of Time and Information - Pratt - 1992 |

16 | Full intuitionistic linear logic (extended abstract - Hyland, Paiva - 1993 |

14 | On the principle of excluded middle - Kolmogorov - 1967 |

13 |
The optimal approach to recursive programs
- Manna, Shamir
- 1977
(Show Context)
Citation Context ...if there is a uniquely defined solution, then that solution should be chosen. We show that this uniquely defined solution corresponds to Manna and Shamir's optimal fixed point (Manna and Shamir 1976, =-=Manna and Shamir 1977-=-) for many natural programs. Manna and Shamir's optimal fixed point is uncomputable in general. However, using notions from proof theory (Troelstra and Schwichtenberg 1996), we show how a constructive... |

13 | On the Foundations of Corecursion
- Moss, Danner
- 1997
(Show Context)
Citation Context ...arr 1979, Pratt 1995), the dialectica (de Paiva 1989a) (de Paiva 1989b) (de Paiva and Hyland 1993) categories, toposes (Klunder 1992) and special final coalgebra (Barwise and Moss 1996) (Pitts 1994) (=-=Moss and Danner 1996-=-) (Freyd 1990, Fiore 1996) constructions. Chu spaces (Pratt 1995, Gupta 1994) have been studied as models of computation because they can describe topologies, event structures (Nielsen et al. 1981) (G... |

12 | Normal forms and cutfree proofs as natural transformations - Girard, Scedrov, et al. - 1989 |

12 |
Dynamic algebras and the nature of induction
- Pratt
- 1980
(Show Context)
Citation Context ...ntal structural properties of computation and have come to the forefront of logical investigations in computer science. Linear logic(Girard 1987), Co-recursion(Pitts 1994), the _-calculus(Kozen 1983, =-=Pratt 1980-=-), and self-dual categories(Barr 1979, Pratt 1995) have attracted much attention. Here we consider many of these same structures, but we started from a logical perspective, where duality appears in th... |

11 | Passivity and independence - Reddy - 1994 |

10 | Applications of Kripke models to Heyting-Brouwer logic - Rauszer - 1977 |

10 |
Notes on N–lattices and constructive logic with strong negation
- Vakarelov
- 1977
(Show Context)
Citation Context ...eans that the congruence relation for the algebra of N can be made from ' jsand :' j :, where ' jsmeans that from the truth of ' you can prove the truth of , i.e. ' oe , and vice versa (Rasiowa 1974, =-=Vakarelov 1977-=-). The algebra for N was first constructed by (Rasiowa 1974), who called it a quasi-pseudo boolean algebra, later dubbed N -lattices after Nelson. Later authors viewed this as a set of restrictions on... |

8 | 1843, A system of Logic - S |

8 |
Linear logic, \Lambda -autonomous categories and cofree coalgebras. Contemporary Mathematics, Volume 92
- Seely
- 1989
(Show Context)
Citation Context ... H is isomorphic to H \ThetasH op. This provides evidence that the algebra for constructible duality might be a model of linear logic with mix. We verify this conjecture directly in the thesis using (=-=Seely 1989-=-). Further there is a correspondence in that any linear logic proof can be translated to a proof in constructible duality using the following table, where the calligraphic letters on the right indicat... |

8 |
A semantical study of constructive falsity. Zeitschrift fur mathematische Logik und Grundlagen der Mathematik
- Thomason
- 1969
(Show Context)
Citation Context ...judged from picking a world in the future and looking backwards, while truth, as is normal is judged forwards, we generate a new model theory for constructible falsity, denoted N . Earlier, Thomason (=-=Thomason 1969-=-) proposed an ordering on worlds with three truth values true, false and undecided for which he shows that N is sound and complete, c.f. similar models by (Gurevich 1977, Routley 1975). Models with mu... |

7 |
The Algebra of Topology’. The Annals of Mathematics 45(1):141–191
- McKinsey, Tarski
- 1944
(Show Context)
Citation Context ... that ? is a projection from the algebra of constructible duality to a dual-Heyting algebra (also called a Brouwerian algebra); thus ? projects the logic of constructible duality to Brouwerian logic (=-=McKinsey and Tarski 1944-=-, Birkhoff 1948). Proposition 132 ! maps H \ThetasH op to H \Thetas1 and ? maps H \ThetasH op to 1 \ThetasHop. Proof: Let A be a point A = ha1; a2i in H \ThetasHop. Then, by definition, !A = A ^ I whe... |

6 |
Optimal fixedpoints of logic programs
- Lassez, Maher
- 1985
(Show Context)
Citation Context ...d point such that ( lub F XP C(\Phi ) ) v f2, we have f2 v f3. These optimal fixed points were first defined by (Manna and Shamir 1976) and studied by (Manna and Shamir 1977, Gallier 1980, Chen 1996, =-=Lassez and Maher 1985-=-). We present the original formulation, rather than later presentation, as Manna and Shamir also studied the relationship between fixed points and equational definitions of functions. Definition 167 (... |

6 |
Semantical Analyses of Propositional Systems of Fitch and
- Routley
- 1974
(Show Context)
Citation Context ...lier, Thomason (Thomason 1969) proposed an ordering on worlds with three truth values true, false and undecided for which he shows that N is sound and complete, c.f. similar models by (Gurevich 1977, =-=Routley 1975-=-). Models with multiple viewpoints are used in relevant logics to avoid the rule of weakening c.f. (Hautam"aki 1982) for a generalization. We give an ordering on worlds having only two truth values tr... |

6 |
Vivid logic
- Wagner
(Show Context)
Citation Context ...n's and Zaslavski^i's symmetrizations of intuitionistic logic which kept the disjunction property in the presence of the additional negation. Recent uses for N (Fitting 1991, Pearce and Wansing 1992, =-=Wagner 1991-=-, Wansing 1993) have also been found in the realm of logic programming using explicitly "false" facts. 3.2.2 Models The first model theory for N was developed by Thomason(Thomason 1969), who used a 3-... |