article

Abstract data type systems

Authors:

Jean-Pierre Jouannaud,

Mitsuhiro OkadaAuthors Info & Claims

Theoretical Computer Science, Volume 173, Issue 2

Pages 349 - 391

https://doi.org/10.1016/S0304-3975(96)00161-2

Published: 28 February 1997 Publication History

Abstract

No abstract available.

Cited By

View all

Okada MTakahashi Y(2020)A Simplified Application of Howard’s Vector Notation System to Termination Proofs for Typed Lambda-Calculus SystemsRewriting Logic and Its Applications10.1007/978-3-030-63595-4_8(136-155)Online publication date: 25-Apr-2020
https://dl.acm.org/doi/10.1007/978-3-030-63595-4_8
Blanqui F(2016)Termination of rewrite relations on λ-terms based on Girard's notion of reducibilityTheoretical Computer Science10.1016/j.tcs.2015.07.045611:C(50-86)Online publication date: 18-Jan-2016
https://dl.acm.org/doi/10.1016/j.tcs.2015.07.045
Cave AFerreira FPanangaden PPientka B(2014)Fair reactive programmingACM SIGPLAN Notices10.1145/2578855.253588149:1(361-372)Online publication date: 8-Jan-2014
https://dl.acm.org/doi/10.1145/2578855.2535881
Show More Cited By

Index Terms

Abstract data type systems
1. Theory of computation
  1. Logic
  2. Semantics and reasoning
    1. Program constructs
      1. Type structures

Recommendations

Polymorphic type inference and abstract data types
Polymorphic type inference and abstract data types

Many statically typed programming languages provide an abstract data type construct, such as the module in Modula-2. However, in most of these languages, implementations of abstract data types are not first-class values. Thus, they cannot be assigned to ...
Relating typability and expressiveness in finite-rank intersection type systems (extended abstract)
ICFP '99: Proceedings of the fourth ACM SIGPLAN international conference on Functional programming

We investigate finite-rank intersection type systems, analyzing the complexity of their type inference problems and their relation to the problem of recognizing semantically equivalent terms. Intersection types allow something of type τ₁ Λ &...

Comments

Information & Contributors

Information

Published In

cover image Theoretical Computer Science

Theoretical Computer Science Volume 173, Issue 2

Special issue: algebraic development techniques

February 28, 1997

240 pages

ISSN:0304-3975

Editors:
M. Nivat
Univ. de Paris VII, Moiselles, France
,
E. Astesiano

Issue’s Table of Contents

Publisher

Elsevier Science Publishers Ltd.

United Kingdom

Publication History

Published: 28 February 1997

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

23
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 06 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Okada MTakahashi Y(2020)A Simplified Application of Howard’s Vector Notation System to Termination Proofs for Typed Lambda-Calculus SystemsRewriting Logic and Its Applications10.1007/978-3-030-63595-4_8(136-155)Online publication date: 25-Apr-2020
https://dl.acm.org/doi/10.1007/978-3-030-63595-4_8
Blanqui F(2016)Termination of rewrite relations on λ-terms based on Girard's notion of reducibilityTheoretical Computer Science10.1016/j.tcs.2015.07.045611:C(50-86)Online publication date: 18-Jan-2016
https://dl.acm.org/doi/10.1016/j.tcs.2015.07.045
Cave AFerreira FPanangaden PPientka B(2014)Fair reactive programmingACM SIGPLAN Notices10.1145/2578855.253588149:1(361-372)Online publication date: 8-Jan-2014
https://dl.acm.org/doi/10.1145/2578855.2535881
Cave AFerreira FPanangaden PPientka BJagannathan SSewell P(2014)Fair reactive programmingProceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages10.1145/2535838.2535881(361-372)Online publication date: 11-Jan-2014
https://dl.acm.org/doi/10.1145/2535838.2535881
Fuhs CKop C(2011)Harnessing first order termination provers using higher order dependency pairsProceedings of the 8th international conference on Frontiers of combining systems10.5555/2050784.2050797(147-162)Online publication date: 5-Oct-2011
https://dl.acm.org/doi/10.5555/2050784.2050797
Blanqui FJouannaud JRubio A(2008)The Computability Path OrderingProceedings of the 22nd international workshop on Computer Science Logic10.1007/978-3-540-87531-4_1(1-14)Online publication date: 16-Sep-2008
https://dl.acm.org/doi/10.1007/978-3-540-87531-4_1
Blanqui F(2007)Computability closureRewriting Computation and Proof10.5555/2391276.2391281(68-88)Online publication date: 1-Jan-2007
https://dl.acm.org/doi/10.5555/2391276.2391281
Bruni RMeseguer J(2006)Semantic foundations for generalized rewrite theoriesTheoretical Computer Science10.1016/j.tcs.2006.04.012360:1(386-414)Online publication date: 21-Aug-2006
https://dl.acm.org/doi/10.1016/j.tcs.2006.04.012
Bertolissi CCirstea HKirchner C(2006)Expressing combinatory reduction systems derivations in the rewriting calculusHigher-Order and Symbolic Computation10.1007/s10990-006-0479-z19:4(345-376)Online publication date: 1-Dec-2006
https://dl.acm.org/doi/10.1007/s10990-006-0479-z
Blanqui FJouannaud JRubio A(2006)Higher-order termination: from kruskal to computabilityProceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning10.1007/11916277_1(1-14)Online publication date: 13-Nov-2006
https://dl.acm.org/doi/10.1007/11916277_1
Show More Cited By

Abstract

Cited By

Index Terms

Recommendations

Polymorphic type inference and abstract data types

Polymorphic type inference and abstract data types

Relating typability and expressiveness in finite-rank intersection type systems (extended abstract)

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations