Article

Tecton: A Language for Manipulating Generic Objects

Authors:

Deepak Kapur,

David R. Musser,

Alexander A. StepanovAuthors Info & Claims

Program Specification, Proceedings of a Workshop

Pages 402 - 414

Published: 01 August 1981 Publication History

Abstract

No abstract available.

Cited By

View all

Bagge AHaveraaen M(2014)Specification of generic APIs, orACM SIGAda Ada Letters10.1145/2692956.266318334:3(71-80)Online publication date: 18-Oct-2014
https://dl.acm.org/doi/10.1145/2692956.2663183
Bagge AHaveraaen MFeldman MTaft T(2014)Specification of generic APIs, orProceedings of the 2014 ACM SIGAda annual conference on High integrity language technology10.1145/2663171.2663183(71-80)Online publication date: 18-Oct-2014
https://dl.acm.org/doi/10.1145/2663171.2663183
Siek J(2010)The c++0x "concepts" effortProceedings of the 2010 international spring school conference on Generic and Indexed Programming10.1007/978-3-642-32202-0_4(175-216)Online publication date: 22-Mar-2010
https://dl.acm.org/doi/10.1007/978-3-642-32202-0_4
Show More Cited By

Recommendations

Decidability of Innermost Termination and Context-Sensitive Termination for Semi-Constructor Term Rewriting Systems

Yi and Sakai [Y. Wang and M. Sakai. Decidability of termination for semi-constructor trss, left-linear shallow trss and related systems. In the 17th International Conference on Rewriting Techniques and Applications, volume 4098 of Lecture Notes in ...
Termination of Innermost Context-Sensitive Rewriting Using Dependency Pairs
FroCoS '07: Proceedings of the 6th international symposium on Frontiers of Combining Systems

Innermost context-sensitive rewriting has been proved useful for modeling computations of programs of algebraic languages like Maude, OBJ, etc. Furthermore, innermost termination of rewriting is often easier to prove than termination. Thus, under ...
Termination of non-simple rewrite systems

Comments

Information & Contributors

Information

Published In

Program Specification, Proceedings of a Workshop

August 1981

421 pages

ISBN:3540114904

Editor:
Jørgen Staunstrup

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 01 August 1981

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

5
Total Citations
View Citations
0
Total Downloads

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

Reflects downloads up to 11 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Bagge AHaveraaen M(2014)Specification of generic APIs, orACM SIGAda Ada Letters10.1145/2692956.266318334:3(71-80)Online publication date: 18-Oct-2014
https://dl.acm.org/doi/10.1145/2692956.2663183
Bagge AHaveraaen MFeldman MTaft T(2014)Specification of generic APIs, orProceedings of the 2014 ACM SIGAda annual conference on High integrity language technology10.1145/2663171.2663183(71-80)Online publication date: 18-Oct-2014
https://dl.acm.org/doi/10.1145/2663171.2663183
Siek J(2010)The c++0x "concepts" effortProceedings of the 2010 international spring school conference on Generic and Indexed Programming10.1007/978-3-642-32202-0_4(175-216)Online publication date: 22-Mar-2010
https://dl.acm.org/doi/10.1007/978-3-642-32202-0_4
Zalewski MSchupp SSiek JTip F(2007)C++ concepts as institutionsProceedings of the 2007 Symposium on Library-Centric Software Design10.1145/1512762.1512770(76-87)Online publication date: 21-Oct-2007
https://dl.acm.org/doi/10.1145/1512762.1512770
Wang CMusser D(1997)Dynamic Verification of C++ Generic AlgorithmsIEEE Transactions on Software Engineering10.1109/32.58852323:5(314-323)Online publication date: 1-May-1997
https://dl.acm.org/doi/10.1109/32.588523

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

Recommendations

Decidability of Innermost Termination and Context-Sensitive Termination for Semi-Constructor Term Rewriting Systems

Termination of Innermost Context-Sensitive Rewriting Using Dependency Pairs

Termination of non-simple rewrite systems

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