Filters








6,411 Hits in 5.6 sec

Optimal representations of polymorphic types with subtyping (Extended abstract) [chapter]

Alexander Aiken, Edward L. Wimmers, Jens Palsberg
1997 Lecture Notes in Computer Science  
We present an algorithm for simplifying quanti ed types in the presence of subtyping and prove it is sound and complete for non-recursive and recursive types. 4 The source code for the Illyria system and  ...  Many type inference and program analysis systems include notions of subtyping and parametric polymorphism.  ...  Acknowledgements The authors would like to thank Martin Abadi for useful discussions about connections to the ideal model as well as the anonymous referees for their criticisms.  ... 
doi:10.1007/bfb0014547 fatcat:m3unkvrjhvd2rctuektuvrmjqq

Symbolic mathematics system evaluators (extended abstract)

Richard J. Fateman
1996 Proceedings of the 1996 international symposium on Symbolic and algebraic computation - ISSAC '96  
The notation and semantics of the CAS should be suitable for algorithmic programming, as well as (several levels) of description of mathematical objects, ranging from the abstract to the relatively concrete  ...  Check to see if there is a unique "signature" f : (B 1 , · · · , B n ) → B in the environment such that for each i, 1 ≤ i ≤ n, A i is a subtype of B i and such that B is a subtype of type u.  ...  A brief explanation of the uprule is probably warranted: this is a rule for rewriting f, but keyed to the evaluator noticing that g is in the top level of arguments to f.  ... 
doi:10.1145/236869.236907 dblp:conf/issac/Fateman96 fatcat:bzwdnup5ifh6jjgzcfpsyffy5y

Time-complexity semantics for feasible affine recursions (extended abstract) [article]

Norman Danner, James S. Royer
2007 arXiv   pre-print
The paper's main work is in extending and simplifying the original time-complexity semantics for ATR to develop a set of tools for extracting and solving the higher-type recurrences arising from feasible  ...  Here we extend ATR so that a broad range of affine recursions are directly expressible.  ...  The subtype relation on base types is defined by T L ≤: T L ′ if L ≤ L ′ and T L ≤: T for all L, and extended to product and function types in the standard way.  ... 
arXiv:cs/0701076v2 fatcat:zvc3qmbf2zeo3floespuh2feuq

I-Java: An Extension of Java with Incomplete Objects and Object Composition [chapter]

Lorenzo Bettini, Viviana Bono, Erica Turin
2009 Lecture Notes in Computer Science  
This work builds on our theoretical model of incomplete objects, which was proved typesafe.  ...  In this paper we present I-Java, an extension of the Java language with a form of incomplete objects, i.e., objects with some missing methods which can be provided at run-time by composition with another  ...  We are also grateful to Alexandre Bergel for his suggestions on the paper.  ... 
doi:10.1007/978-3-642-02655-3_4 fatcat:sm36ivshkbag5ifrmeabejv2gu

Automatic inference of abstract type behavior

Mihai Balint
2010 Proceedings of the IEEE/ACM international conference on Automated software engineering - ASE '10  
Assuming that formal specifications are available for a set of subtypes, we present our early doctoral research on the automatic inference of an extended deterministic finite automaton that describes the  ...  legal usage of abstract supertypes and ensures the behavioral subtyping relation as defined by the Liskov Substitution Principle (LSP).  ...  We gratefully acknowledge Marius Minea for his extensive feedback. We also acknowledge Petru Mihacea, Daniel Ratiu and Casandra Holotescu for their suggestions and editorial advice.  ... 
doi:10.1145/1858996.1859097 dblp:conf/kbse/Balint10 fatcat:gowbnqlhobgbpenzn54ks6bm7m

Object Incompleteness and Dynamic Composition in Java-Like Languages [chapter]

Lorenzo Bettini, Viviana Bono, Betti Venneri
2008 Lecture Notes in Business Information Processing  
In this paper we present Incomplete Featherweight Java (IFJ), an extension of Featherweight Java with incomplete objects, i.e., objects that require some missing methods which can be provided at run-time  ...  Incomplete object usage is disciplined by static typing, therefore the language enjoys type safety (which implies no "message-not-understood" run-time errors).  ...  We thank the anonymous referees for comments which helped us to improve the paper.  ... 
doi:10.1007/978-3-540-69824-1_12 fatcat:xmtgbyil65h5hlmk2yxb6qi3pe

Type safe dynamic object delegation in class-based languages

Lorenzo Bettini, Viviana Bono
2008 Proceedings of the 6th international symposium on Principles and practice of programming in Java - PPPJ '08  
In this paper we present Incomplete Featherweight Java (IFJ), an extension of Featherweight Java with incomplete objects, i.e., objects that require some missing methods which can be provided at run-time  ...  The mechanism for method invocation is based on delegation and it is disciplined by static typing, therefore the language enjoys type safety (which implies no "message-not-understood" run-time errors)  ...  We also thank the anonymous referees for useful advices on how to improve the paper.  ... 
doi:10.1145/1411732.1411756 dblp:conf/pppj/BettiniB08 fatcat:qlxj6wpcofhg3bxoldpi5hbj5e

Pragmatic subtyping in polymorphic languages

Johan Nordlander
1998 Proceedings of the third ACM SIGPLAN international conference on Functional programming - ICFP '98  
As the main contribution of the paper, we describe a partial type inference algorithm for the extended system which favours succinctness over generality, in the sense that it never infers types with subtype  ...  constraints.  ...  Acknowledgement The author would like to thank Thomas Hallgren, Magnus Carlsson, Lars Pareto, Björn von Sydow, Fritz Henglein, and the ICFP referees for comments, encouragement, and instructive feedback  ... 
doi:10.1145/289423.289445 dblp:conf/icfp/Nordlander98 fatcat:yn2wl6yhwnd3zpw5mipex7qeoi

Pragmatic subtyping in polymorphic languages

Johan Nordlander
1999 SIGPLAN notices  
As the main contribution of the paper, we describe a partial type inference algorithm for the extended system which favours succinctness over generality, in the sense that it never infers types with subtype  ...  constraints.  ...  Acknowledgement The author would like to thank Thomas Hallgren, Magnus Carlsson, Lars Pareto, Björn von Sydow, Fritz Henglein, and the ICFP referees for comments, encouragement, and instructive feedback  ... 
doi:10.1145/291251.289445 fatcat:jbzjnwknqjhzzdro4ubortizta

Sound Merging and Differencing for Class Diagrams [chapter]

Uli Fahrenberg, Mathieu Acher, Axel Legay, Andrzej Wąsowski
2014 Lecture Notes in Computer Science  
The differences we synthesize are represented using class diagram notation (not edits, or instances), which allows creation of a simple yet flexible algebra for diffing and merging.  ...  One could, instead, resort to using Object Constraint Language to obtain more precise differencing. Fig. 3 . We have a class diagram C which is a subtype of another, D.  ...  Then M |= C 1 , as witnessed by the extended object typing Oty 1 = {a : A, a : B, b : B}, and M |= C 2 , witness by Oty 2 = oty M = {a : A, b : B}.  ... 
doi:10.1007/978-3-642-54804-8_5 fatcat:ft5cymrqk5fhhbp3wp7niw2uvu

Page 8274 of Mathematical Reviews Vol. , Issue 2001K [page]

2001 Mathematical Reviews  
for extensible, incomplete objects.  ...  Com- put. 1 (1994), no. 1, 3-37; MR 95m:68109] with a mechanism of width subtyping and a treatment of incomplete objects.  ... 

A flow-based approach for variant parametric types

Wei-Ngan Chin, Florin Craciun, Siau-Cheng Khoo, Corneliu Popeea
2006 Proceedings of the 21st annual ACM SIGPLAN conference on Object-oriented programming systems, languages, and applications - OOPSLA '06  
Our scheme stands to benefit from past (and future) advances in flow analysis and subtyping constraints.  ...  Furthermore, it fully supports casting for variant types with a special reflection mechanism, called cast capture, to handle objects with unknown types.  ...  We also thank Alex Aiken, Greg Morrisett and Martin Rinard for providing useful feedback on this work.  ... 
doi:10.1145/1167473.1167498 dblp:conf/oopsla/ChinCKP06 fatcat:vghhmidzczh7xdcdr352p5ux54

A flow-based approach for variant parametric types

Wei-Ngan Chin, Florin Craciun, Siau-Cheng Khoo, Corneliu Popeea
2006 SIGPLAN notices  
Our scheme stands to benefit from past (and future) advances in flow analysis and subtyping constraints.  ...  Furthermore, it fully supports casting for variant types with a special reflection mechanism, called cast capture, to handle objects with unknown types.  ...  We also thank Alex Aiken, Greg Morrisett and Martin Rinard for providing useful feedback on this work.  ... 
doi:10.1145/1167515.1167498 fatcat:3lp4lbdx2verrk5ltze2gni3bq

Systematically refactoring inheritance to delegation in java

Hannes Kegel, Friedrich Steimann
2008 Proceedings of the 13th international conference on Software engineering - ICSE '08  
The refactoring builds on constraint graphs originally developed for type inference to check the preconditions and to compute the necessary delegation as well as the subtype relationships that must be  ...  An object using a trait is basically extended by the trait's set of methods.  ...  For instance, if Superclass 2 is abstract, it will not work since abstract classes cannot be instantiated so that no delegatees can be created.  ... 
doi:10.1145/1368088.1368147 dblp:conf/icse/KegelS08 fatcat:zhmeg2ykivbbzjqbp447caakey

Integrating Ontology into SBVR

Dane Sorensen, Anthony Pastiak, Amit Mitra, Amar Gupta
2006 Social Science Research Network  
Objects of this type exist in information space as abstract patterns of information.  ...  For example, the concept 'parent' is an abstraction delimited by another abstraction, the concept 'generation', which is normalized by the concept 'ancestor'.  ... 
doi:10.2139/ssrn.906579 fatcat:vwknuijbtvfi7pv5s56sc43r7u
« Previous Showing results 1 — 15 out of 6,411 results