Péter Müller · 2015
class AbstractSet { ... // requires true // ensures true // static requires true // static ensures contains( o ) void add( Object o ) { // add o to set } } class BoundedSet extends AbstractSet { // requires true // ensures old( size contains( o ) void add( Object o ) { if ( size < capacity ) super.add( o ); } }
Cited by 0
Jouni Kerman, Andrew Gelman, J. Kerman et al. · 2008
Abstract Practical Bayesian data analysis involves manipulating and summarizing simulations from the posterior distribution of the unknown parameters. By manipulation we mean computing posterior distributions of functions of the unknowns, and generating posterior predictive distributions. The results need to be summarized both numerically and graphically. We introduce, and implement in R, an object-oriented programming paradigm based on a random variable object type that is implicitly represented by simulations. This makes it possible to define vector and array objects that may contain both random and deterministic quantities, and syntax rules that allow to treat these objects like any numeric vectors or arrays, providing a solution to various problems encountered in Bayesian computing involving posterior simulations. We illustrate the use of this new programming environment with examples of Bayesian computing, demonstrating missing-value imputation, nonlinear summary of regression predictions, and posterior predictive checking.
Cited by 0
Past Year Exam Question · UTPedia (Universiti Teknologi Petronas) · 2022
Cited by 0
Richard L. Apodaca · Front Matter · 2019
Back in 1968, Edsger Dijkstra published his well-known "go to statement considered harmful" letter advocating the abolition of the GOTO statement from high-level programming languages: At the time, GOTO was well-regarded and widely-used, as evidence by the controversy surrounding Dijkstra's letter and the length of time it took languages supporting GOTO, or its use in languages that sill support it, to decline.
Cited by 0Open access
Past Year Exam Question, · Padua@thesis (Department of Information Engineering University of Padova) · 2010
Cited by 0
莊淇銘; Chung, Chi-ming; Lee, M. C. · 1994
Cited by 0
Arivanantham Thangavelu , Monali Shivaji Bachhav , Dr. V. Sindhu , R. Jini · Zenodo (CERN European Organization for Nuclear Research) · 2025
Cited by 0Open access
ECOOP 2003 Darmstadt, Cardelli, Luca · Lecture notes in computer science · 2003
Cited by 161
Gary F. Bennett, Brad Lees · Apress eBooks · 2014
Over the past 15 years, the programming world focused on the development paradigm of object-oriented programming (OOP). Most modern development environments and languages implement OOP. Put simply, OOP forms the basis of everything you develop today.
Cited by 0
Schmidt, H.W. · CSIRO · 1992
Cited by 4Open access
Derek Rayside, Gerard T. Campbell · ACM SIGCSE Bulletin · 2000
Classifying is a central activity in object-oriented programming and distinguishes it from procedural programming. Traditional logic, initiated by Aristotle, assigns classification to our first activity in reasoning, whereby we come to know what a thing is . Such a grasp of the thing's whatness is the foundation for all further reasoning about it. This connection between Aristotle's way of classifying and object-oriented programming is sometimes acknowledged, but rarely explored in depth. 1 We explore this relation more closely and more carefully, in the hope that a better understanding of classification and programming can be gained from a study of philosophy than from many current text books on object-oriented programming.
Cited by 2Open access
2006
Cited by 0
Lecture notes in computer science · 2007
Cited by 178
Apress eBooks · 2006
Cited by 0
Bertrand Meyer · Communications of the ACM · 1993
udging by the looks of the two parties, the marriage between concurrent computation and object-oriented programming-a union much desired by practitioners in such fields as telecommunications, highperformance computing, banking and operating systems--appears easy enough to arrange. This appearance, however, is deceptive: the problem is a hard one. This article points the way toward a pos,;ible solution. The precise problem examined here is restricted to:
Cited by 171Open access
WORLD SCIENTIFIC eBooks · 1990
Cited by 1
Andrew Troelsen · Apress eBooks · 2003
In the previous chapter, you were introduced to a number of core constructs of the C# language and the .NET platform in general. Here, you will spend your time digging deeper into the details of object-based development. I begin by reviewing the famed "pillars of OOP" from a high level, and then examine exactly how C# contends with the notions of encapsulation, inheritance, and polymorphism. This will equip you with the knowledge you need in order to build custom class hierarchies using C#.KeywordsBase ClassPublic EmployeeObject UserNest TypePublic ClassThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Cited by 10
Dale A. Schoenefeld · 1997
An undergraduate junior or senior level course in object-oriented design and programming is described. The course assumes familiarity with ANSI C and with data structures. The course is a popular elective among upper division students. The small, elegant, pure, and powerful object-oriented language Eiffel is used to illustrate the significant object concepts and as a guide to identifying the most relevant subsets of the C++ and Java languages.
Cited by 2Open access
Bing Swen · ACM SIGPLAN Notices · 2000
Object systems employing inheritance exclusively can suffer various difficulties when mapping real world object relations. This paper presents induction, as a universal software engineering methodology, to complement inheritance. We found out that a special form of induction, called virtual induction, is a powerful mechanism for abstracting and reusing existing code and can be well blended with inheritance. A C++ implementation of the mechanism is also discussed.
Cited by 1Open access
CDU eSpace Institutional Repository (Charles Darwin University)
Cited by 0