Article

A Primitive Calculus for Module Systems

Authors:

Davide Ancona,

Elena ZuccaAuthors Info & Claims

PPDP '99: Proceedings of the International Conference PPDP'99 on Principles and Practice of Declarative Programming

Pages 62 - 79

Published: 29 September 1999 Publication History

Abstract

No abstract available.

Cited By

View all

Russo C(2012)Recursive structures for standard MLACM SIGPLAN Notices10.1145/2442776.244278447:4a(48-59)Online publication date: 18-Mar-2012
https://dl.acm.org/doi/10.1145/2442776.2442784
Fagorzi SZucca E(2007)A calculus of open modulesMathematical Structures in Computer Science10.1017/S096012950700623817:4(675-751)Online publication date: 1-Aug-2007
https://dl.acm.org/doi/10.1017/S0960129507006238
Flatt MFindler RFelleisen M(2006)Scheme with classes, mixins, and traitsProceedings of the 4th Asian conference on Programming Languages and Systems10.1007/11924661_17(270-289)Online publication date: 8-Nov-2006
https://dl.acm.org/doi/10.1007/11924661_17
Show More Cited By

Recommendations

A calculus of module systems

We present CMS, a simple and powerful calculus of modules supporting mutual recursion and higher order features, which can be instantiated over an arbitrary core calculus satisfying standard assumptions. The calculus allows expression of a large variety ...
The Bang Calculus: an untyped lambda-calculus generalizing call-by-name and call-by-value
PPDP '16: Proceedings of the 18th International Symposium on Principles and Practice of Declarative Programming

We introduce and study the Bang Calculus, an untyped functional calculus in which the promotion operation of Linear Logic is made explicit and where application is a bilinear operation. This calculus, which can be understood as an untyped version of ...
Adding the modal mu-calculus to the instruction-set process calculus

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

PPDP '99: Proceedings of the International Conference PPDP'99 on Principles and Practice of Declarative Programming

September 1999

432 pages

ISBN:3540665404

Editor:
Gopalan Nadathur

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 29 September 1999

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

17
Total Citations
View Citations
0
Total Downloads

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

Reflects downloads up to 12 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Russo C(2012)Recursive structures for standard MLACM SIGPLAN Notices10.1145/2442776.244278447:4a(48-59)Online publication date: 18-Mar-2012
https://dl.acm.org/doi/10.1145/2442776.2442784
Fagorzi SZucca E(2007)A calculus of open modulesMathematical Structures in Computer Science10.1017/S096012950700623817:4(675-751)Online publication date: 1-Aug-2007
https://dl.acm.org/doi/10.1017/S0960129507006238
Flatt MFindler RFelleisen M(2006)Scheme with classes, mixins, and traitsProceedings of the 4th Asian conference on Programming Languages and Systems10.1007/11924661_17(270-289)Online publication date: 8-Nov-2006
https://dl.acm.org/doi/10.1007/11924661_17
Cremet VGarillot FLenglet SOdersky M(2006)A core calculus for scala type checkingProceedings of the 31st international conference on Mathematical Foundations of Computer Science10.1007/11821069_1(1-23)Online publication date: 28-Aug-2006
https://dl.acm.org/doi/10.1007/11821069_1
Makholm HWells J(2005)Type inference, principal typings, and let-polymorphism for first-class mixin modulesACM SIGPLAN Notices10.1145/1090189.108638640:9(156-167)Online publication date: 12-Sep-2005
https://dl.acm.org/doi/10.1145/1090189.1086386
Dreyer D(2005)Recursive type generativityACM SIGPLAN Notices10.1145/1090189.108637240:9(41-53)Online publication date: 12-Sep-2005
https://dl.acm.org/doi/10.1145/1090189.1086372
Makholm HWells JDanvy OPierce B(2005)Type inference, principal typings, and let-polymorphism for first-class mixin modulesProceedings of the tenth ACM SIGPLAN international conference on Functional programming10.1145/1086365.1086386(156-167)Online publication date: 28-Sep-2005
https://dl.acm.org/doi/10.1145/1086365.1086386
Dreyer DDanvy OPierce B(2005)Recursive type generativityProceedings of the tenth ACM SIGPLAN international conference on Functional programming10.1145/1086365.1086372(41-53)Online publication date: 28-Sep-2005
https://dl.acm.org/doi/10.1145/1086365.1086372
Dreyer D(2004)A type system for well-founded recursionACM SIGPLAN Notices10.1145/982962.96402639:1(293-305)Online publication date: 1-Jan-2004
https://dl.acm.org/doi/10.1145/982962.964026
Dreyer DJones NLeroy X(2004)A type system for well-founded recursionProceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages10.1145/964001.964026(293-305)Online publication date: 14-Jan-2004
https://dl.acm.org/doi/10.1145/964001.964026
Show More Cited By

View Options

View options

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

A calculus of module systems

The Bang Calculus: an untyped lambda-calculus generalizing call-by-name and call-by-value

Adding the modal mu-calculus to the instruction-set process calculus

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations