Filters








1,794 Hits in 3.2 sec

Runtime Behavior of Conversion Interpretation of Subtyping [chapter]

Yasuhiko Minamide
2002 Lecture Notes in Computer Science  
A programming language with subtyping can be translated into a language without subtyping by inserting conversion functions.  ...  We study runtime behavior of translated programs and show that this translation preserves execution time and stack space within a factor determined by the types in a program.  ...  Acknowledgments This work is partially supported by Japan Society for the Promotion of Science, Grant-in-Aid for Encouragement of Young Scientists of Japan, No. 13780193, 2001.  ... 
doi:10.1007/3-540-46028-4_10 fatcat:bjj4xamtxjbnxm23ptlapyqe5m

An Approach to Behavioral Subtyping Based on Static Analysis

Francesco Logozzo
2005 Electronical Notes in Theoretical Computer Science  
In mainstream object oriented languages the subclass relation is defined in terms of subtyping, i.e. a class A is a subclass of B if the type of A is a subtype of B.  ...  Furthermore we show how this approach yields a more semantic characterization of class hierarchies and how it can be used for an effective modular analysis of polymorphic code.  ...  Static Checking of Behavioral Subtyping.  ... 
doi:10.1016/j.entcs.2004.02.074 fatcat:cteijqkop5cpdhorz6ew3yv72y

Flow Java: Declarative Concurrency for Java [chapter]

Frej Drejhammar, Christian Schulte, Per Brand, Seif Haridi
2003 Lecture Notes in Computer Science  
We present how to moderately extend compilation and the runtime architecture of an existing Java implementation for Flow Java.  ...  For some pathological cases the runtime increases by up to 75%.  ...  to t , if t is a subtype of t.  ... 
doi:10.1007/978-3-540-24599-5_24 fatcat:j6g3eexhf5cedpucbclwge4vd4

Instant pickles

Heather Miller, Philipp Haller, Eugene Burmako, Martin Odersky
2013 Proceedings of the 2013 ACM SIGPLAN international conference on Object oriented programming systems languages & applications - OOPSLA '13  
Acknowledgments We would like to thank the anonymous OOPSLA 2013 referees for their thorough reviews and helpful suggestions which greatly improved the quality of the paper.  ...  For the generation of runtime picklers our framework supports two possible strategies: • Runtime interpretation of a type-specialized pickler • Runtime compilation of a type-specialized pickler Interpreted  ...  An interpreted pickler is created based on the runtime class of the picklee.  ... 
doi:10.1145/2509136.2509547 dblp:conf/oopsla/MillerHBO13 fatcat:tf3diljqp5cgni7lx2dh23you4

Instant pickles

Heather Miller, Philipp Haller, Eugene Burmako, Martin Odersky
2013 SIGPLAN notices  
Acknowledgments We would like to thank the anonymous OOPSLA 2013 referees for their thorough reviews and helpful suggestions which greatly improved the quality of the paper.  ...  For the generation of runtime picklers our framework supports two possible strategies: • Runtime interpretation of a type-specialized pickler • Runtime compilation of a type-specialized pickler Interpreted  ...  An interpreted pickler is created based on the runtime class of the picklee.  ... 
doi:10.1145/2544173.2509547 fatcat:awmmnpbcwjbippwlffm53ln7bi

Efficient Compilation of .NET Programs for Embedded Systems

Olivier Sallenave, Roland Ducournau
2012 Journal of Object Technology  
Preliminary results show a noticeable reduction of the code size, class hierarchy and polymorphism of the programs we optimize.  ...  In this paper, we explore the implications of using whole program optimizations such as Rapid Type Analysis (RTA) and coloring on programs targeting the .Net infrastructure.  ...  Acknowledgments We would like to thank: David Kerr-Munslow for his careful reviews, Floréal Morandat, who helped to put together the first version of this paper (thanks to his L A T E X skills), and the  ... 
doi:10.5381/jot.2012.11.3.a5 fatcat:ruoifnpasnhkjkkva7cpqi6jau

Efficient compilation of .NET programs for embedded systems

Olivier Sallenave, Roland Ducournau
2010 Proceedings of the Workshop on the Implementation, Compilation, Optimization of Object-Oriented Languages, Programs and Systems - ICOOOLPS '10  
Preliminary results show a noticeable reduction of the code size, class hierarchy and polymorphism of the programs we optimize.  ...  In this paper, we explore the implications of using whole program optimizations such as Rapid Type Analysis (RTA) and coloring on programs targeting the .Net infrastructure.  ...  Acknowledgments We would like to thank: David Kerr-Munslow for his careful reviews, Floréal Morandat, who helped to put together the first version of this paper (thanks to his L A T E X skills), and the  ... 
doi:10.1145/1925801.1925804 dblp:conf/ecoop/SallenaveD10 fatcat:3bfvxachqvf2zbd5al3wcfibsi

Gradual refinement types

Nico Lehmann, Éric Tanter
2017 Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages - POPL 2017  
Guided by abstract interpretation, we extend the gradual typing agenda and develop the notion of gradual refinement types, allowing smooth evolution and interoperability between simple types and logicallyrefined  ...  The first challenge leads to a crucial notion of locality for refinement formulas, and the second yields novel operators related to type-and term-level substitution, identifying new opportunity for runtime  ...  Non-Contradicting Interpretation To avoid this extremely permissive behavior, we must develop a non-contradicting interpretation of gradual formulas.  ... 
doi:10.1145/3009837.3009856 fatcat:xjdftigpkrbd7eah63jaom5w4u

Abstracting Gradual Typing Moving Forward: Precise and Space-Efficient (Technical Report) [article]

Felipe Bañados Schwerter, Alison M. Clark, Khurram A. Jafery, Ronald Garcia
2020 arXiv   pre-print
We recast the latter as an abstract interpretation of subtyping itself, while gradual types still abstract static types.  ...  To the contrary, the default operational semantics of AGT may fail to enforce some invariants in surprising ways. We demonstrate this in the GTFL_≲ language of Garcia et al. [2016].  ...  The key difference in this new approach is that the set of evidence objects form in their entirety an abstract interpretation of static subtyping.  ... 
arXiv:2010.14094v2 fatcat:xluygu445bbhfchys7lkhozu7y

Parameterized types for Java

Joseph A. Bank, Andrew C. Myers, Barbara Liskov
1997 Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '97  
We discuss both the rationale for our design decisions and the impact of the extension on other parts of Java, including arrays and the class library.  ...  We have extended the Java bytecode interpreter to provide good performance for parameterized code in both execution speed and code size, without slowing down non-parameterized code.  ...  The motivation for the Java subtyping rule seems to be that it is better to check stores at runtime than to copy the entire array when a conversion from S[ ] to T[ ] is desired.  ... 
doi:10.1145/263699.263714 dblp:conf/popl/BankLM97 fatcat:i2bcfvl7tnefph7ujtbqhlipbe

A theory of gradual effect systems

Felipe Bañados Schwerter, Ronald Garcia, Éric Tanter
2014 SIGPLAN notices  
We appeal to abstract interpretation to develop and validate the concepts of gradual effect checking.  ...  We extend the generic type-and-effect framework of Marino and Millstein with a notion of unknown effects, which turns out to be significantly more subtle than unknown types in traditional gradual typing  ...  to a notion of consistent subtyping.  ... 
doi:10.1145/2692915.2628149 fatcat:xveuwpukhfdgvdiwcrjynap7ty

Behavioral interfaces for executable DSLs

Dorian Leroy, Erwan Bousse, Manuel Wimmer, Tanja Mayerhofer, Benoit Combemale, Wieland Schwinger
2020 Journal of Software and Systems Modeling  
Executable domain-specific languages (DSLs) enable the execution of behavioral models.  ...  We implemented the proposed metalanguage in the GEMOC Studio and show how behavioral interfaces enable the realization of tools that are generic and thus usable for different executable DSLs.  ...  To view a copy of this licence, visit http://creativecomm ons.org/licenses/by/4.0/.  ... 
doi:10.1007/s10270-020-00798-2 pmid:32728354 pmcid:PMC7374479 fatcat:psx6nz4j6napva5cfjgegwatxa

A theory of gradual effect systems

Felipe Bañados Schwerter, Ronald Garcia, Éric Tanter
2014 Proceedings of the 19th ACM SIGPLAN international conference on Functional programming - ICFP '14  
We appeal to abstract interpretation to develop and validate the concepts of gradual effect checking.  ...  We extend the generic type-and-effect framework of Marino and Millstein with a notion of unknown effects, which turns out to be significantly more subtle than unknown types in traditional gradual typing  ...  to a notion of consistent subtyping.  ... 
doi:10.1145/2628136.2628149 dblp:conf/icfp/SchwerterGT14 fatcat:wcbunjwaezhgrnbu6ppw6beovq

Safe & Efficient Gradual Typing for TypeScript

Aseem Rastogi, Nikhil Swamy, Cédric Fournet, Gavin Bierman, Panagiotis Vekris
2015 SIGPLAN notices  
to Matthias Felleisen, Shriram Krishnamurthi, and Sam Tobin-Hochstadt for suggesting improvements to our discussion of related work.  ...  Acknowledgments Our thanks to Martín Abadi, Mads Torgersen and the TypeScript team for several useful discussions; to the anonymous reviewers of the paper and artifact for their valuable feedback; and  ...  Our main results are expressed as a weak forward-simulation (meaning that runtime checks do not alter the behavior of welltyped programs, except when a dynamic type safety violation is detected) and an  ... 
doi:10.1145/2775051.2676971 fatcat:osdqmehnrza2lldysmomf3n5ui

Safe & Efficient Gradual Typing for TypeScript

Aseem Rastogi, Nikhil Swamy, Cédric Fournet, Gavin Bierman, Panagiotis Vekris
2015 Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages - POPL '15  
to Matthias Felleisen, Shriram Krishnamurthi, and Sam Tobin-Hochstadt for suggesting improvements to our discussion of related work.  ...  Acknowledgments Our thanks to Martín Abadi, Mads Torgersen and the TypeScript team for several useful discussions; to the anonymous reviewers of the paper and artifact for their valuable feedback; and  ...  Our main results are expressed as a weak forward-simulation (meaning that runtime checks do not alter the behavior of welltyped programs, except when a dynamic type safety violation is detected) and an  ... 
doi:10.1145/2676726.2676971 dblp:conf/popl/RastogiSFBV15 fatcat:memljtt7fvd5lkn4sqic7p7nzy
« Previous Showing results 1 — 15 out of 1,794 results