Skip to main content

Monotonic versus antimonotonic exponentiation

  • Conference paper
  • First Online:
Typed Lambda Calculi and Applications (TLCA 1993)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 664))

Included in the following conference series:

  • 140 Accesses

Abstract

We investigate the relationship between the monotonic (→) and the antimonotonic exponentiation (➾) in a type system with subtyping. We present a model in which we can develop both exponentiations at the same time. In this model the monotonic and the antimonotonic exponentiation enjoy a duality, namely α➾β=∁(α→∁β) where ∁ is the type constructor complement. We give a sound and complete system of axioms for the type system with the type constructors →, ➾, ∪, ∩, ∁, ⊥, T.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Engeler, E.: Algebras and combinators. Algebra Universalis 13 (1981) 389–392

    Google Scholar 

  2. Otth, D.: Konsistente Operatoren. ETHZ Report(1990)

    Google Scholar 

  3. Otth, D.: Types and Consistency in Combinatory Algebras. Dissertation 9800, ETHZ (1992).

    Google Scholar 

  4. Plotkin, G.: A powerdomain construction. SIAM J. Comput. 5 (1976) 452–487

    Google Scholar 

  5. Schellinx, H.: Isomorphisms and nonisomorphisms of graph models. J. of Symbolic Logic, 56 (1991) 227–249

    Google Scholar 

  6. Scott, D.: Data types as lattices. SIAM J. Comput. 5 (1976) 522–587

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Marc Bezem Jan Friso Groote

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Otth, D.F. (1993). Monotonic versus antimonotonic exponentiation. In: Bezem, M., Groote, J.F. (eds) Typed Lambda Calculi and Applications. TLCA 1993. Lecture Notes in Computer Science, vol 664. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0037115

Download citation

  • DOI: https://doi.org/10.1007/BFb0037115

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-56517-8

  • Online ISBN: 978-3-540-47586-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics