Filters








64,504 Hits in 3.0 sec

Type Soundness for Path Polymorphism [article]

Andrés Viso, Eduardo Bonelli, Mauricio Ayala-Rincón
2016 arXiv   pre-print
Path polymorphism is the ability to define functions that can operate uniformly over arbitrary recursively specified data structures.  ...  Our solution combines type application, constants as types, union types and recursive types.  ...  This pattern embodies the essence of what is known as path polymorphism [17, 19] since it abstracts a path being "split".  ... 
arXiv:1601.03271v2 fatcat:f3x3jzkhuzadnkpjcdvcufkbfu

Type Soundness for Path Polymorphism

Andrés Viso, Eduardo Bonelli, Mauricio Ayala-Rincón
2016 Electronical Notes in Theoretical Computer Science  
Path polymorphism is the ability to define functions that can operate uniformly over arbitrary recursively specified data structures.  ...  Our solution combines type application, constants as types, union types and recursive types.  ...  This pattern embodies the essence of what is known as path polymorphism [17, 19] since it abstracts a path being "split".  ... 
doi:10.1016/j.entcs.2016.06.015 fatcat:gjgaxyiq65cvbno7e6srfk3khm

Efficient Type Checking for Path Polymorphism

Juan Edi, Andrés Viso, Eduardo Bonelli, Marc Herbstritt
2018 Types for Proofs and Programs  
A type system combining type application, constants as types, union types (associative, commutative and idempotent) and recursive types has recently been proposed for statically typing path polymorphism  ...  We study type-checking for this type system in two stages. First we propose algorithms for checking type equivalence and subtyping based on coinductive characterizations of those relations.  ...  T Y P E S 2 0 1 5 6:4 Efficient Type Checking for Path Polymorphism Type-Checking for CAP.  ... 
doi:10.4230/lipics.types.2015.6 dblp:conf/types/EdiVB15 fatcat:prriuezrorbn5hlfw7wtwcgb3y

Efficient Type Checking for Path Polymorphism [article]

Juan Edi and Andrés Viso and Eduardo Bonelli
2017 arXiv   pre-print
A type system combining type application, constants as types, union types (associative, commutative and idempotent) and recursive types has recently been proposed for statically typing path polymorphism  ...  We study type-checking for this type system in two stages. First we propose algorithms for checking type equivalence and subtyping based on coinductive characterizations of those relations.  ...  For cyclic types pairs for which no order can be determined are encapsulated within the same strongly connected component. Conclusions We address efficient type-checking for path polymorphism.  ... 
arXiv:1704.09026v1 fatcat:opmgxtv3ibe6lmyfsjkrzzvq6u

Efficient Type Checking for Path Polymorphism *

Juan, Andrés Viso, Eduardo Bonelli
unpublished
A type system combining type application, constants as types, union types (associative, com-mutative and idempotent) and recursive types has recently been proposed for statically typing path polymorphism  ...  We study type-checking for this type system in two stages. First we propose algorithms for checking type equivalence and subtyping based on coinductive characterizations of those relations.  ...  Polymorphism Type-Checking for CAP.  ... 
fatcat:souv62zmjndmbot6iiuuzpanc4

Multi-polymorphic programming in bondi

Thomas Given-Wilson, Freeman Huang, Barry Jay
2013 Proceedings of the 9th ACM SIGPLAN workshop on Generic programming - WGP '13  
The bondi programming language is multi-polymorphic, in that it supports four polymorphic programming styles within a small core of computation, namely a typed pattern calculus. bondi's expressive power  ...  , generic functional, relational, path-based, and object-oriented programming styles, respectively.  ...  It employs data polymorphism, path polymorphism, path matching and inclusion polymorphism in a natural manner.  ... 
doi:10.1145/2502488.2502493 dblp:conf/icfp/Given-WilsonHJ13 fatcat:u572upviqfchrjinzxgpkf53va

Test Path Selection of Polymorphic Call-sites

Anshu Bansal, Rajesh K. Bhatia
2014 International Journal of Computer Applications  
The paper proposes System Dependence Graph (SDG) based algorithm to select different test paths for testing polymorphic call-sites.  ...  In addition, the algorithm considers only the method bindings of a polymorphic call-site having different definition sets. As a result, the number of test paths for testing polymorphism gets reduced.  ...  INTRODUCTION Object-oriented features such as inheritance, polymorphism and dynamic binding etc. introduced the new types of faults like Yo-Yo graph problem, Inconsistent Type Use (ITU), State Definition  ... 
doi:10.5120/18061-8993 fatcat:zmbnmqix2bca7oxoef2vwubc3u

Explaining type inference

Dominic Duggan, Frederick Bent
1996 Science of Computer Programming  
for type explanation.  ...  A difficulty with type inference is the confusing and sometimes counter-intuitive diagnostics produced by the type checker as a result of type errors.  ...  Acknowledgements We thank John Ophel for providing the original idea of a type explanation facility for ML. We also thank the anonymous reviewers for their useful comments and suggestions.  ... 
doi:10.1016/0167-6423(95)00007-0 fatcat:ie7meo3hg5aepn737iwj5nzc3u

Type-base flow analysis

Jakob Rehof, Manuel Fähndrich
2001 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '01  
While each of the features -polymorphism and subtyping -are established as practical components of type inference systems, their simultaneous combination in polymorphic subtyping is not: scaling up polymorphic  ...  and includes polymorphic recursion. 1 I n t r o d u c t i o n Type-based program analyses have received much attention (see, e.g., [Hei95, PO95, Mos96, HM97, NNH99, FRD00b]).  ...  In the absence of recursive types however, polymorphic type structure is bounded and guarantees that there always exists a flow path where the two matchings are perfectly nested (this follows abstractly  ... 
doi:10.1145/360204.360208 dblp:conf/popl/RehofF01 fatcat:c7gjnbqasrbapgzokgcjhfbbwi

Precise concrete type inference for object-oriented languages

John Plevyak, Andrew A. Chien
1994 Proceedings of the ninth annual conference on Object-oriented programming systems, language, and applications - OOPSLA '94  
Concrete type information is invaluable for program optimization. The determination of concrete types in object-oriented languages is a flow sensitive global data flow problem.  ...  We present an incremental constraint-based type inference which produces precise concrete type information for a much larger class of programs at lower cost.  ...  or polymorphic function call path for data and functional polymorphism, respectively.  ... 
doi:10.1145/191080.191130 dblp:conf/oopsla/PlevyakC94 fatcat:pfywpeiz4jff3gcdkmwtvikvl4

Precise concrete type inference for object-oriented languages

John Plevyak, Andrew A. Chien
1994 SIGPLAN notices  
Concrete type information is invaluable for program optimization. The determination of concrete types in object-oriented languages is a flow sensitive global data flow problem.  ...  We present an incremental constraint-based type inference which produces precise concrete type information for a much larger class of programs at lower cost.  ...  or polymorphic function call path for data and functional polymorphism, respectively.  ... 
doi:10.1145/191081.191130 fatcat:wgyx3rw3drfrjij3nrixnwa5ke

Testing coupling relationships in object-oriented programs

Roger T. Alexander, Jeff Offutt, Andreas Stefik
2010 Software testing, verification & reliability  
The execution path is no longer a function of the class's static declared type, but a function of the dynamic type that is not known until run-time.  ...  Specifically, methods tend to be smaller and less complex, so path-based testing techniques are less applicable.  ...  Polymorphic coupling paths The instance coupling paths above do not allow for polymorphic behavior when the actual type differs from the declared type.  ... 
doi:10.1002/stvr.417 fatcat:omwoowguznbqxeohjlvk3g2fwe

Familia: unifying interfaces, type classes, and family polymorphism

Yizhou Zhang, Andrew C. Myers
2017 Proceedings of the ACM on Programming Languages  
But harmoniously integrating these apparently distinct mechanisms-and powerful recent forms of them, including type classes and family polymorphism-in a single language remains an elusive goal.  ...  We describe the design of a programming language that incorporates this mechanism; using a core calculus, we show that the type system is sound.  ...  Nevertheless, the static semantics may create such paths to facilitate type checking. Given an inexact class path P 1 " P ! 2 .c[ω], we use P ! 1 to mean the exact class path P ! 2 .c ! [ω].  ... 
doi:10.1145/3133894 dblp:journals/pacmpl/ZhangM17 fatcat:7r3t65ndzjcy3n7b3zxgoongiu

An Overview of F-OML: An F-Logic Based Object Modeling Language

Mira Balaban, Michael Kifer
2010 Electronic Communications of the EASST  
F-OML is layered on top of an elegant formal language of guarded path expressions, called PathLP, which is used to define objects and their types.  ...  This wide range of applications of F-OML stems from several language features, including polymorphism, multi-level object modeling, and model instantiation.  ...  This is a typing fact. It consists of a type path expression, that imposes a type and cardinality constraint on all members of the SystemTable class.  ... 
doi:10.14279/tuj.eceasst.36.537 dblp:journals/eceasst/BalabanK10 fatcat:zriv3ejh4vg3lfirrluz7v7xym

Flow insensitive C++ pointers and polymorphism analysis and its application to slicing

Paolo Tonella, Giuliano Antoniol, Roberto Fiutem, Ettore Merlo
1997 Proceedings of the 19th international conference on Software engineering - ICSE '97  
G++ object members under the access path framework and seconcl to be compatible with the low cost PTA presented in [17] , To deal with polymorphism, we integrate the r-types with the standard type information  ...  [17] , Well-typedness can be espressed in terms of typing constraints [17] , the satisfaction of which is obt,ained through the application of join() or c-join() ,a~ described above.  ... 
doi:10.1145/253228.253371 dblp:conf/icse/TonellaAFM97 fatcat:cboihulquncmzcjm4mpe4jdzly
« Previous Showing results 1 — 15 out of 64,504 results