C.Dony: An Exception Handling System for an Object-Oriented Language. Procs of.ECOOP'88, 1988; Lectures Notes in Comp. Sci. 322, pp. 146-161. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
A Fully Object-Oriented Exception Handling System: - Rationale And Smalltalk (2001) Self-citation (Dony Handling) (Correct)
....languages at the end of the 1980s (Zetalisp Flavors [17] CommonLisp( CLOS) 19] Eiffel [14] Objectworks Smalltalk [21] C [11] or more recently in Java. This papers presents an overview of the specification and implementation of an exception handling system initially conceived [3] for the Lore Object Oriented Language and adapted to Smalltalk [4] The key ideas of this system are (1) to apply object oriented design to the whole system, to define a reusable and open class library for exception handling allowing systems designers to reuse it to produce dedicated exception ....
C.Dony: An Exception Handling System for an Object-Oriented Language. Procs of.ECOOP'88, 1988; Lectures Notes in Comp. Sci. 322, pp. 146-161.
Exception Handling and Object-Oriented Programming: towards a.. - Dony (1990) (14 citations) Self-citation (Dony Handling) (Correct)
No context found.
C.Dony: An Exception Handling System for an Object-Oriented Language.Procs of ECOOP'88, pp. 146-161 Oslo, Norway, Aug. 1988; Lectures Notes in Comp. Sci. 322.
Counting the number of solutions - A survey of recent inclusion.. - Toran Self-citation (Tor'an Counting Classes) (Correct)
....K. Some straightforward relations among the defined classes are BPP PP, and PhiP P PP . It is also known that P PhiP = PhiP [16] and that P BPP =BPP [32] i.e. PhiP and BPP are closed under polynomial time Turing reducibility. There are relativizations separating all three classes [4,17,26]. Based on the class PP, and in a similar way as it is done with NP in PH, it is possible to define a hierarchy of complexity classes (PP, PP PP : which is called the counting hierarchy [25,29] Classes as operators Based on the definition of certain language classes, it can be useful ....
....FewP. The difference is that here the exact number of accepting paths for machine M on an input x is not known, but it depends on integer ff x . There are relativizations under which a result like theorem 8 cannot be achieved for the case of classes with an unbounded number of accepting paths [26]. However the above result is strong enough for proving the lowness of PhiP for P PP . Theorem 21: 23] PhiP is low for P PP . Proof: We show that PP PhiP is included in P PP . The result follows taking the Turing reducibility closure of both classes. Let L be a language in PP PhiP ....
J. Tor'an: A combinatorial technique for separating counting complexity classes. Proc. 16th ICALP Conference, Lecture notes in Comp. Science, (1989), 733--745.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC