Article

Conventional and Uniqueness Typing in Graph Rewrite Systems

Authors:

Erik Barendsen,

Sjaak SmetsersAuthors Info & Claims

Proceedings of the 13th Conference on Foundations of Software Technology and Theoretical Computer Science

Pages 41 - 51

Published: 15 December 1993 Publication History

Abstract

No abstract available.

Cited By

View all

Merriënboer BBreuleux OBergeron ALamblin P(2018)Automatic differentiation in MLProceedings of the 32nd International Conference on Neural Information Processing Systems10.5555/3327546.3327553(8771-8781)Online publication date: 3-Dec-2018
https://dl.acm.org/doi/10.5555/3327546.3327553
Paykin JZdancewic S(2017)The linearity MonadACM SIGPLAN Notices10.1145/3156695.312296552:10(117-132)Online publication date: 7-Sep-2017
https://dl.acm.org/doi/10.1145/3156695.3122965
Henriksen TSerup NElsman MHenglein FOancea C(2017)Futhark: purely functional GPU-programming with nested parallelism and in-place array updatesACM SIGPLAN Notices10.1145/3140587.306235452:6(556-571)Online publication date: 14-Jun-2017
https://dl.acm.org/doi/10.1145/3140587.3062354
Show More Cited By

Index Terms

Conventional and Uniqueness Typing in Graph Rewrite Systems
1. Mathematics of computing
  1. Discrete mathematics
2. Theory of computation
  1. Formal languages and automata theory
    1. Formalisms
      1. Rewrite systems

Index terms have been assigned to the content through auto-classification.

Recommendations

Uniqueness typing in natural deduction style
FP'95: Proceedings of the 1995 international conference on Functional Programming

We present two type systems for graph rewriting: conventional typing and (polymorphic) uniqueness typing. The latter is introduced as a natural extension of simple algebraic and higher-order uniqueness typing. The systems are given in natural deduction ...
Termination of non-simple rewrite systems
More precise typing of rewrite strategies
LDTA '11: Proceedings of the Eleventh Workshop on Language Descriptions, Tools and Applications

The programming concept of rewrite strategies supports versatile composition of rewrite rules and control of their application. Such programmability of rewrites can possibly lead to incorrect compositions of rewrites or incorrect applications of rewrites ...

Comments

Information & Contributors

Information

Published In

Proceedings of the 13th Conference on Foundations of Software Technology and Theoretical Computer Science

December 1993

453 pages

ISBN:3540575294

Editor:
R. K. Shyamasundar

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 15 December 1993

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

38
Total Citations
View Citations
0
Total Downloads

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

Reflects downloads up to 27 Jul 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Merriënboer BBreuleux OBergeron ALamblin P(2018)Automatic differentiation in MLProceedings of the 32nd International Conference on Neural Information Processing Systems10.5555/3327546.3327553(8771-8781)Online publication date: 3-Dec-2018
https://dl.acm.org/doi/10.5555/3327546.3327553
Paykin JZdancewic S(2017)The linearity MonadACM SIGPLAN Notices10.1145/3156695.312296552:10(117-132)Online publication date: 7-Sep-2017
https://dl.acm.org/doi/10.1145/3156695.3122965
Henriksen TSerup NElsman MHenglein FOancea C(2017)Futhark: purely functional GPU-programming with nested parallelism and in-place array updatesACM SIGPLAN Notices10.1145/3140587.306235452:6(556-571)Online publication date: 14-Jun-2017
https://dl.acm.org/doi/10.1145/3140587.3062354
Paykin JZdancewic SDiatchki I(2017)The linearity MonadProceedings of the 10th ACM SIGPLAN International Symposium on Haskell10.1145/3122955.3122965(117-132)Online publication date: 7-Sep-2017
https://dl.acm.org/doi/10.1145/3122955.3122965
Henriksen TSerup NElsman MHenglein FOancea CCohen AVechev M(2017)Futhark: purely functional GPU-programming with nested parallelism and in-place array updatesProceedings of the 38th ACM SIGPLAN Conference on Programming Language Design and Implementation10.1145/3062341.3062354(556-571)Online publication date: 14-Jun-2017
https://dl.acm.org/doi/10.1145/3062341.3062354
Osvald LEssertel GWu XAlayón LRompf T(2016)Gentrification gone too far? affordable 2nd-class values for fun and (co-)effectACM SIGPLAN Notices10.1145/3022671.298400951:10(234-251)Online publication date: 19-Oct-2016
https://dl.acm.org/doi/10.1145/3022671.2984009
O'Connor LChen ZRizkallah CAmani SLim JMurray TNagashima YSewell TKlein G(2016)Refinement through restraint: bringing down the cost of verificationACM SIGPLAN Notices10.1145/3022670.295194051:9(89-102)Online publication date: 4-Sep-2016
https://dl.acm.org/doi/10.1145/3022670.2951940
Osvald LEssertel GWu XAlayón LRompf TVisser ESmaragdakis Y(2016)Gentrification gone too far? affordable 2nd-class values for fun and (co-)effectProceedings of the 2016 ACM SIGPLAN International Conference on Object-Oriented Programming, Systems, Languages, and Applications10.1145/2983990.2984009(234-251)Online publication date: 19-Oct-2016
https://dl.acm.org/doi/10.1145/2983990.2984009
O'Connor LChen ZRizkallah CAmani SLim JMurray TNagashima YSewell TKlein GGarrigue JKeller GSumii E(2016)Refinement through restraint: bringing down the cost of verificationProceedings of the 21st ACM SIGPLAN International Conference on Functional Programming10.1145/2951913.2951940(89-102)Online publication date: 4-Sep-2016
https://dl.acm.org/doi/10.1145/2951913.2951940
Andreetta CBégot VBerthold JElsman MHenglein FHenriksen TNordfang MOancea C(2016)FinParACM Transactions on Architecture and Code Optimization10.1145/289835413:2(1-27)Online publication date: 27-Jun-2016
https://dl.acm.org/doi/10.1145/2898354
Show More Cited By

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

Cited By

Index Terms

Recommendations

Uniqueness typing in natural deduction style

Termination of non-simple rewrite systems

More precise typing of rewrite strategies

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations