Inherence and Nonsubstantial Particulars: An Object-Oriented View Samuel H. Kenyon

Size: px
Start display at page:

Download "Inherence and Nonsubstantial Particulars: An Object-Oriented View Samuel H. Kenyon"

Transcription

1 Inherence and Nonsubstantial Particulars: An Object-Oriented View Samuel H. Kenyon 09/29/04

2 Kenyon 2 Introduction In order to tackle the meanings, assumptions, and inconsistencies in Aristotle s Categories[1], and now Metaphysics, I translated as much as I could conceptually into a framework I am more familiar with Object-Oriented Programming (OOP). OOP is a design paradigm for computer programming, with associated languages, diagram standards, etc [2]. Regardless of your OOP experience, the object-oriented analogies will make sense if you keep in mind that objects are (for the most part) just containers of attributes (variables) and methods (functions). That and various class relations are enough for a programmer to model any real world object, concrete or abstract. I do not mean to propose that metaphysics is OOP, or that a divine entity/process designed the physics (the world) with object-oriented metaphysics. I will explicate that in another paper. Nor are the objects in this paper necessarily the same as in any other metaphysical context. So the first question is, can these objects (class instantiations) describe the subjects of inhesion, or that which is inhered, or both? My view is that class instantiations can describe both, but then there is the question: Can objects be nonsubstantial? In this paper I will develop my object-oriented description and then compare my analogies with other interpretations of the Categories inherence issue. Inherence According to the dictionary [3], inherence is The fact or condition of inhering; the state or quality of being inherent; permanent existence (as of an attribute) in a subject; indwelling. Consider this as a link to the object-oriented view: This relation of inherence and permanent coexistence in one nature is expressed by the word attribute [4]. How one thinks of attribute is important. Defining or describing properties of an object as being inside said object may follow from how one models or abstractly conceives the object or its class. It is worth mentioning that in OOP, diagrams of classes (and/or objects instantiated from these classes) usually show the attributes (properties) and methods inside the box representing the class. So when one actually tries to draw the concept of an object, if it is a block diagram it makes sense to show the attributes inside the object. Even if the attributes are drawn in their own boxes and connected to the class, or if the diagram is a tree or outline diagram, one can still map between the inside diagrams and the other forms. In order to further discuss inherence, we must describe predication. In the Categories Part 2 (1a16), Aristotle gave four kinds of things based on a combination of two kinds: predicated of or said of a subject, depending on the translation present in or in a subject The second one, in, is referring to inherence. To avoid confusion with the word predication we can use Moravcsik s idea [5] of two senses of predication predicated on top of (predicated + inherence). Moravcsik gives this example: For example, man is predicated of Socrates, but man or manhood is predicated of Socrates; white is to be predicated but white or whiteness inheres in men. Let us assume that the first predicated should have been written as predicated to maintain lexical consistency. This should help clear up the linguistic versus ontological issues for inherence. Here is a key OOP insight: The said of predication (predication ) is analogous to class inheritance 1. When a child class inherits its parent, what it is inheriting are attributes and methods 2. We are not dealing with objects themselves now, but with classes. Said of and said of the predicate translate to is the parent class of. It follows that in reverse, predicated translates to is-a. Species and genera are child- 1 It is most likely public inheritance, but for simplicity in this paper we will ignore public/private qualifiers. 2 For our purposes we can clump methods along with attributes and just call them attributes or properties.

3 Kenyon 3 parent relationships, and can be mapped onto this system of class hierarchies. Animal is-a LivingOrganism; Human is-a Animal. My interpretation of Dancy's view [6] is that all things are said of, and the in relationship is just a way of referring to the inherited properties of a subject. Dancy said, What is in the subject is the abstraction or property correlated with that predicate. This seems to fit with OOP except that we have to allow properties that are not inherited, otherwise there would be no specialization. Whatever an object contains (i.e., inheres) is displaying a has-a relationship, regardless of any is-a connections. Differentiae If a subject s attributes are nonsubstantial particulars, it follows that differentiae are inheritable nonsubstantial particulars, because the OOP view does not distinguish between properties and differentiae they are both attributes. We will return to nonsubstantial particulars shortly. In OOP when you inherent you are not only making an is-a relationship, but the derived object is actually constructed with an object of its parent class contained inside it, very much like the specialized properties already contained by this child object. Say we have a class called Human. We also define a subclass Philosopher that is-a Human. Philosopher adds some attributes to Human, such as BasketsWoven (a quantity particular). Given Philosopher P, we can access P.BasketsWoven and P.HairColor, but HairColor is really coming from the Human object inside of P. Philosopher is a Human the greater class is predicated of the lesser, so that all the differentiae of the predicate will be differentiae also of the subject (Categories 1b22). Philosopher is said to be the lesser here because it is the subject and Human is the predicate. Although all Humans including Philosophers can be differentiated by HairColor, not all Humans can be differentiated by BasketsWoven whereas all Philosophers can be. The Has-A Relationship Has-a means containment. When you say Socrates is pale or Socrates has pale, you really mean in the metaphysical framework: Socrates.Complexion == light where light could simply be a point along some gradient of values that can be assigned to Complexion; indeed Complexion must at all times have some value. Or: Socrates.Pale == true which implies that: Socrates.Toasted == false So what, then, is.pale here? The OOP view has not yet explained any better what kind of being paleness is, even if we force the format to be a single Complexion with many possible states instead of many attributes of the Pale kind that are all boolean. What kind of beings are those that we refer to with inherent labels? In object-oriented programming the obvious answer is that the inherent properties of an object are themselves objects 3. In fact, an object-oriented programmer has no qualms about making a class that contains an object of that same class 4. So we still have this problem: Are the inherent objects substances? Can they exist on their own? Right now they are not substances, they are nonsubstantial particulars. Let us compare what others have to say on inherence and nonsubstantial particulars. Nonsubstantial Particulars 3 Yes, most languages include intrinsic types (e.g., integers), but as variables they can be thought of as objects, and intrinsic types can be thought of and often used just like classes. 4 Of course, in computer programming, design time, compile time, and run time are all well defined. Only at run time (execution) is a class instantiated into an object.

4 Kenyon 4 The OOP view as I have developed it concurs mostly with Ackrill s view as defined by [7]; this will be shown shortly. So far the OOP view has not made a distinction between properties and parts. Are they both attributes of the subject? This difference, whether grammatical or ontological must be worked out, otherwise we may be conflicting with Aristotle out of the bounds of reinterpretation. Ackrill and Owen both require x to not be a part of y, but it is Frede s account that is most potentially hazardous to the OOP view. As described by [8], Frede interprets part as part of the definition. It seems that any attribute of an object is part of its definition and thus fails Frede s formula. However, that can be fixed if we say definition is the class, and specify x as an object. We are mostly dealing with classes though, not the instantiations. Also, Frede s account may still be incompatible with OOP because of his one-place predicate interpretation, as [8] says, he is defining what it is to be an accident, the sort of thing that is in a subject, rather than what it is for x to be in y. Subject properties are attributes instances within an instance. Are these attribute objects tropes? Since there are so many different versions of trope theory [9] I will not digress on them, except to say that inhered objects are similar to tropes. The inhered is always, however, a particular. But wait, you say: These are classes, thus universals (with limitations), thus they are shareable and not particular. The first rebuttal to that is: At the point of instantiation, however, the classes do become particulars. Multiple particulars can be of the same type. What you say? OOP to the rescue: the attributes in a subject are named as applicable for that specific subject. Even if attribute a of class C is in subject s, attribute x of type C in subject y can also exist. One instance is named a, and the other is named x. (Notice I freely interchange class and type.) This fixes the problem with Ackrill s account as outlined by [8]. My examples of x above seems to meet Ackrill s requirements without limiting the universal C to any one subject: 1. x:c belongs to y 2. x:c is not part of y 3. x:c does not exist separately from y (even though a:c does) As such, the object-oriented view has some problems. Here is one way to fix it so that we do not have attributes floating around outside of their containers, and so that there is still a difference between said of and in things: We could limit an inhered object to an instantiation of an inner class, which is defined inside the class that is instantiated into the containing object (the subject of inherence). No other class can have objects of that inner class, nor can an object of that inner class exist on its own therefore it also cannot be said of anything. Said of things would be defined with classes not inner, except in some theoretical class of all classes. This fix is flawed without serious mutation because it breaks our aforementioned non-limitation of universals between subjects. A more complicated solution would involve making an ontological equivalent of a programming namespace system, which we will not discuss. We can survive by merely realizing that the attributes can never float anyway, that is what the nonsubstantial categories categorize: quantity, quality, relation, place, etc. What fills in those columns are just the classes which do not alone indicate who is using them as attributes. You are not referring to attributes of class C unless you speak of the class D that inheres attributes of class C. As for differentiating said of and in classes, we want the flexibility to have things that are both and neither, as Aristotle had four combinations in Part 2 of the Categories. Figuring out how a nonsubstantial particular can or cannot be predicated or inhered should not seriously wound the rest of the OOP-inspired view as it applies to inherence. Object-Oriented Weirdness One weirdness of the object-oriented view is that when we are discussing the class hierarchy as it fits into

5 Kenyon 5 the Categories, all the subjects, including those that are in others, are being discussed in class form. They have not been instantiated yet until they get into our realm. Until the level of Socrates existing, his attributes are in classes above him. A lot is happening in those classes above him to get to the class(es) most specific to Human, and even more specific to the Socrates class (i.e., form) if there is one. Problems of priority and dependence are not answered so far with this view, except that a class must be defined before it can be instantiated. But in a metaphysical ontology, is there a temporal difference between class creation and object creation? If it must be a different type of priority or dependence, then the classobject mechanism (or just its temporal aspect) may need to be transformed into that ontological space somehow. As for turning classes into objects, I do not think that the question What is class instantiation? is any more mysterious now than how a form is related to an individual; indeed, it is now obvious that one can think of the how as a process or transformation, as a recipe even. References [1] Aristotle, Categories, tr. E.M. Edghill, 350 BCE. [2] Object-oriented programming, Wikipedia, [Online]. Available: [3] Oxford English Dictionary, second ed., [4] J. Martineau, Types of Ethical Theory, I. I. II. iii. 136, (As quoted by [oed].) [5] J.M.E. Moravcsik, Aristotle on predication, The Philosophical Review, Vol. 76, No. 1, Jan. 1967, pp [6] R. Dancy, On some of Aristotle s first thoughts about substances, The Philosophical Review, Vol. 84, No. 3, July 1975, pp [7] M. S. Cohen, In a subject in the Categories: Three Interpretations, [Online]. Available: [8] M. S. Cohen, Nonsubstantial Particulars, in The Stanford Encyclopedia of Philosophy, Winter 2003 ed., E. N. Zalta, Ed. [Online]. Available: [9] J. Bacon, Tropes, in The Stanford Encyclopedia of Philosophy, Fall 2002 ed., E. N. Zalta, Ed. [Online]. Available:

Lesson 10A OOP Fundamentals. By John B. Owen All rights reserved 2011, revised 2014

Lesson 10A OOP Fundamentals. By John B. Owen All rights reserved 2011, revised 2014 Lesson 10A OOP Fundamentals By John B. Owen All rights reserved 2011, revised 2014 Table of Contents Objectives Definition Pointers vs containers Object vs primitives Constructors Methods Object class

More information

THE FOUNDATIONS OF MATHEMATICS

THE FOUNDATIONS OF MATHEMATICS THE FOUNDATIONS OF MATHEMATICS By: Sterling McKay APRIL 21, 2014 LONE STAR - MONTGOMERY Mentor: William R. Brown, MBA Mckay 1 In mathematics, truth is arguably the most essential of its components. Suppose

More information

(Refer Slide Time 6:48)

(Refer Slide Time 6:48) Digital Circuits and Systems Prof. S. Srinivasan Department of Electrical Engineering Indian Institute of Technology Madras Lecture - 8 Karnaugh Map Minimization using Maxterms We have been taking about

More information

What is a Class? Short Answer. Responding to Messages. Everything in Python is an Object 11/8/2010

What is a Class? Short Answer. Responding to Messages. Everything in Python is an Object 11/8/2010 The Practice of Computing Using PYTHON William Punch Richard Enbody Chapter 11 Introduction to Classes class Student(object): """Simple Student class.""" def init (self,first='', last='', id=0): # init

More information

Intro. Scheme Basics. scm> 5 5. scm>

Intro. Scheme Basics. scm> 5 5. scm> Intro Let s take some time to talk about LISP. It stands for LISt Processing a way of coding using only lists! It sounds pretty radical, and it is. There are lots of cool things to know about LISP; if

More information

6.001 Notes: Section 8.1

6.001 Notes: Section 8.1 6.001 Notes: Section 8.1 Slide 8.1.1 In this lecture we are going to introduce a new data type, specifically to deal with symbols. This may sound a bit odd, but if you step back, you may realize that everything

More information

After a lecture on cosmology and the structure of the solar system, William James was accosted by a little old lady.

After a lecture on cosmology and the structure of the solar system, William James was accosted by a little old lady. Introduction After a lecture on cosmology and the structure of the solar system, William James was accosted by a little old lady. Your theory that the sun is the centre of the solar system, and the earth

More information

SOFTWARE ENGINEERING Prof.N.L.Sarda Computer Science & Engineering IIT Bombay. Lecture #10 Process Modelling DFD, Function Decomp (Part 2)

SOFTWARE ENGINEERING Prof.N.L.Sarda Computer Science & Engineering IIT Bombay. Lecture #10 Process Modelling DFD, Function Decomp (Part 2) SOFTWARE ENGINEERING Prof.N.L.Sarda Computer Science & Engineering IIT Bombay Lecture #10 Process Modelling DFD, Function Decomp (Part 2) Let us continue with the data modeling topic. So far we have seen

More information

CPS122 Lecture: From Python to Java last revised January 4, Objectives:

CPS122 Lecture: From Python to Java last revised January 4, Objectives: Objectives: CPS122 Lecture: From Python to Java last revised January 4, 2017 1. To introduce the notion of a compiled language 2. To introduce the notions of data type and a statically typed language 3.

More information

Managing Application Configuration Data with CIM

Managing Application Configuration Data with CIM Managing Application Configuration Data with CIM Viktor Mihajlovski IBM Linux Technology Center, Systems Management Introduction The configuration of software, regardless whether

More information

CITS5501 Software Testing and Quality Assurance Formal methods

CITS5501 Software Testing and Quality Assurance Formal methods CITS5501 Software Testing and Quality Assurance Formal methods Unit coordinator: Arran Stewart May 1, 2018 1 / 49 Sources Pressman, R., Software Engineering: A Practitioner s Approach, McGraw-Hill, 2005

More information

A state-based 3-way batch merge algorithm for models serialized in XMI

A state-based 3-way batch merge algorithm for models serialized in XMI A state-based 3-way batch merge algorithm for models serialized in XMI Aron Lidé Supervisor: Lars Bendix Department of Computer Science Faculty of Engineering Lund University November 2011 Abstract With

More information

"Relations for Relationships"

Relations for Relationships M359 An explanation from Hugh Darwen "Relations for Relationships" This note might help those who have struggled with M359's so-called "relation for relationship" method of representing, in a relational

More information

COMS 1003 Fall Introduction to Computer Programming in C. Bits, Boolean Logic & Discrete Math. September 13 th

COMS 1003 Fall Introduction to Computer Programming in C. Bits, Boolean Logic & Discrete Math. September 13 th COMS 1003 Fall 2005 Introduction to Computer Programming in C Bits, Boolean Logic & Discrete Math September 13 th Hello World! Logistics See the website: http://www.cs.columbia.edu/~locasto/ Course Web

More information

CIS233J Java Programming II. Threads

CIS233J Java Programming II. Threads CIS233J Java Programming II Threads Introduction The purpose of this document is to introduce the basic concepts about threads (also know as concurrency.) Definition of a Thread A thread is a single sequential

More information

Subclassing for ADTs Implementation

Subclassing for ADTs Implementation Object-Oriented Design Lecture 8 CS 3500 Fall 2009 (Pucella) Tuesday, Oct 6, 2009 Subclassing for ADTs Implementation An interesting use of subclassing is to implement some forms of ADTs more cleanly,

More information

Current State of ontology in engineering systems

Current State of ontology in engineering systems Current State of ontology in engineering systems Henson Graves, henson.graves@hotmail.com, and Matthew West, matthew.west@informationjunction.co.uk This paper gives an overview of the current state of

More information

(Provisional) Lecture 08: List recursion and recursive diagrams 10:00 AM, Sep 22, 2017

(Provisional) Lecture 08: List recursion and recursive diagrams 10:00 AM, Sep 22, 2017 Integrated Introduction to Computer Science Hughes (Provisional) Lecture 08: List recursion and recursive diagrams 10:00 AM, Sep 22, 2017 Contents 1 Announcements 1 2 Evaluation Correction 1 3 Lists 2

More information

AP COMPUTER SCIENCE JAVA CONCEPTS IV: RESERVED WORDS

AP COMPUTER SCIENCE JAVA CONCEPTS IV: RESERVED WORDS AP COMPUTER SCIENCE JAVA CONCEPTS IV: RESERVED WORDS PAUL L. BAILEY Abstract. This documents amalgamates various descriptions found on the internet, mostly from Oracle or Wikipedia. Very little of this

More information

functional thinking applying the philosophy of functional programming to system design and architecture

functional thinking applying the philosophy of functional programming to system design and architecture functional thinking applying the philosophy of functional programming to system design and architecture Jed Wesley-Smith @jedws functional programming has many benefits: better program reasonability, composition,

More information

Concept as a Generalization of Class and Principles of the Concept-Oriented Programming

Concept as a Generalization of Class and Principles of the Concept-Oriented Programming Computer Science Journal of Moldova, vol.13, no.3(39), 2005 Concept as a Generalization of Class and Principles of the Concept-Oriented Programming Alexandr Savinov Abstract In the paper we describe a

More information

What are the characteristics of Object Oriented programming language?

What are the characteristics of Object Oriented programming language? What are the various elements of OOP? Following are the various elements of OOP:- Class:- A class is a collection of data and the various operations that can be performed on that data. Object- This is

More information

Programming in C++ Prof. Partha Pratim Das Department of Computer Science and Engineering Indian Institute of Technology, Kharagpur

Programming in C++ Prof. Partha Pratim Das Department of Computer Science and Engineering Indian Institute of Technology, Kharagpur Programming in C++ Prof. Partha Pratim Das Department of Computer Science and Engineering Indian Institute of Technology, Kharagpur Lecture - 43 Dynamic Binding (Polymorphism): Part III Welcome to Module

More information

Where The Objects Roam

Where The Objects Roam CS61A, Spring 2006, Wei Tu (Based on Chung s Notes) 1 CS61A Week 8 Where The Objects Roam (v1.0) Paradigm Shift (or: The Rabbit Dug Another Hole) And here we are, already ready to jump into yet another

More information

COP 3330 Final Exam Review

COP 3330 Final Exam Review COP 3330 Final Exam Review I. The Basics (Chapters 2, 5, 6) a. comments b. identifiers, reserved words c. white space d. compilers vs. interpreters e. syntax, semantics f. errors i. syntax ii. run-time

More information

CS Bootcamp Boolean Logic Autumn 2015 A B A B T T T T F F F T F F F F T T T T F T F T T F F F

CS Bootcamp Boolean Logic Autumn 2015 A B A B T T T T F F F T F F F F T T T T F T F T T F F F 1 Logical Operations 1.1 And The and operator is a binary operator, denoted as, &,, or sometimes by just concatenating symbols, is true only if both parameters are true. A B A B F T F F F F The expression

More information

(Refer Slide Time 3:31)

(Refer Slide Time 3:31) Digital Circuits and Systems Prof. S. Srinivasan Department of Electrical Engineering Indian Institute of Technology Madras Lecture - 5 Logic Simplification In the last lecture we talked about logic functions

More information

Software Testing Prof. Rajib Mall Department of Computer Science and Engineering Indian Institute of Technology, Kharagpur

Software Testing Prof. Rajib Mall Department of Computer Science and Engineering Indian Institute of Technology, Kharagpur Software Testing Prof. Rajib Mall Department of Computer Science and Engineering Indian Institute of Technology, Kharagpur Lecture - 07 Special Value Testing Welcome to this session. So far we had looked

More information

Propositional Logic. Part I

Propositional Logic. Part I Part I Propositional Logic 1 Classical Logic and the Material Conditional 1.1 Introduction 1.1.1 The first purpose of this chapter is to review classical propositional logic, including semantic tableaux.

More information

Multi-Place Predicates and Multiple Quantifiers

Multi-Place Predicates and Multiple Quantifiers Multi-Place Predicates and Multiple Quantifiers So far we have looked only at monadic predicates. That is, predicates that apply to only one thing. For instance, Fa might mean Alice is friendly. But, what

More information

In our first lecture on sets and set theory, we introduced a bunch of new symbols and terminology.

In our first lecture on sets and set theory, we introduced a bunch of new symbols and terminology. Guide to and Hi everybody! In our first lecture on sets and set theory, we introduced a bunch of new symbols and terminology. This guide focuses on two of those symbols: and. These symbols represent concepts

More information

Deep Integration of Scripting Languages and Semantic Web Technologies

Deep Integration of Scripting Languages and Semantic Web Technologies Deep Integration of Scripting Languages and Semantic Web Technologies Denny Vrandečić Institute AIFB, University of Karlsruhe, Germany denny@aifb.uni-karlsruhe.de Abstract. Python reached out to a wide

More information

What is an algorithm?

What is an algorithm? Reminders CS 142 Lecture 4 ADTs & Objects Program 1 was assigned - Due on 1/27 by 11:55pm Spring 2015 2 Object-Oriented Programming (OOP) OOP Definitions Imagine: You and your programming team have written

More information

CS103 Spring 2018 Mathematical Vocabulary

CS103 Spring 2018 Mathematical Vocabulary CS103 Spring 2018 Mathematical Vocabulary You keep using that word. I do not think it means what you think it means. - Inigo Montoya, from The Princess Bride Consider the humble while loop in most programming

More information

Unit 1 : Principles of object oriented programming

Unit 1 : Principles of object oriented programming Unit 1 : Principles of object oriented programming Difference Between Procedure Oriented Programming (POP) & Object Oriented Programming (OOP) Divided Into Importance Procedure Oriented Programming In

More information

(Refer Slide Time 5:19)

(Refer Slide Time 5:19) Digital Circuits and Systems Prof. S. Srinivasan Department of Electrical Engineering Indian Institute of Technology, Madras Lecture - 7 Logic Minimization using Karnaugh Maps In the last lecture we introduced

More information

Object Oriented Paradigm Languages

Object Oriented Paradigm Languages Object Oriented Paradigm Languages The central design goal is to build inherent abstraction into the system, moving all the abstract implementation details from the user level (ad-hoc) to the system level

More information

School of Computer Science CPS109 Course Notes Set 7 Alexander Ferworn Updated Fall 15 CPS109 Course Notes 7

School of Computer Science CPS109 Course Notes Set 7 Alexander Ferworn Updated Fall 15 CPS109 Course Notes 7 CPS109 Course Notes 7 Alexander Ferworn Unrelated Facts Worth Remembering The most successful people in any business are usually the most interesting. Don t confuse extensive documentation of a situation

More information

9/19/12. Why Study Discrete Math? What is discrete? Sets (Rosen, Chapter 2) can be described by discrete math TOPICS

9/19/12. Why Study Discrete Math? What is discrete? Sets (Rosen, Chapter 2) can be described by discrete math TOPICS What is discrete? Sets (Rosen, Chapter 2) TOPICS Discrete math Set Definition Set Operations Tuples Consisting of distinct or unconnected elements, not continuous (calculus) Helps us in Computer Science

More information

The State Design Pattern

The State Design Pattern B B Chapter 24 The State Design Pattern The state design pattern is an object-oriented technique that uses inheritance and class composition. It is applicable to a variety of software design problems where

More information

Subclasses, Superclasses, and Inheritance

Subclasses, Superclasses, and Inheritance Subclasses, Superclasses, and Inheritance To recap what you've seen before, classes can be derived from other classes. The derived class (the class that is derived from another class) is called a subclass.

More information

The Rise of OOP: Part 1 [The Early Years] Dina Lamdany

The Rise of OOP: Part 1 [The Early Years] Dina Lamdany The Rise of OOP: Part 1 [The Early Years] Dina Lamdany The Java Tutorials If you've never used an object-oriented programming language before, you'll need to learn a few basic concepts before you can

More information

Scope. CSC 4181 Compiler Construction. Static Scope. Static Scope Rules. Closest Nested Scope Rule

Scope. CSC 4181 Compiler Construction. Static Scope. Static Scope Rules. Closest Nested Scope Rule Scope CSC 4181 Compiler Construction Scope and Symbol Table A scope is a textual region of the program in which a (name-to-object) binding is active. There are two types of scope: Static scope Dynamic

More information

1 of 10 5/11/2006 12:10 AM CS 61A Spring 2006 Midterm 3 solutions 1. Box and pointer. > (let ((x (list 1 2 3))) (set-car! (cdr x) (cddr x)) x) (1 (3) 3) +-------------+ V --------- -- ------ ---------

More information

L322 Syntax. Chapter 3: Structural Relations. Linguistics 322 D E F G H. Another representation is in the form of labelled brackets:

L322 Syntax. Chapter 3: Structural Relations. Linguistics 322 D E F G H. Another representation is in the form of labelled brackets: L322 Syntax Chapter 3: Structural Relations Linguistics 322 1 The Parts of a Tree A tree structure is one of an indefinite number of ways to represent a sentence or a part of it. Consider the following

More information

Lecture 23: Priority Queues 10:00 AM, Mar 19, 2018

Lecture 23: Priority Queues 10:00 AM, Mar 19, 2018 CS18 Integrated Introduction to Computer Science Fisler, Nelson Lecture 23: Priority Queues 10:00 AM, Mar 19, 2018 Contents 1 Priority Queues 1 2 Binary Heaps 2 3 Heaps 4 4 Aside: The Ordered Trait 5 5

More information

CS103 Handout 29 Winter 2018 February 9, 2018 Inductive Proofwriting Checklist

CS103 Handout 29 Winter 2018 February 9, 2018 Inductive Proofwriting Checklist CS103 Handout 29 Winter 2018 February 9, 2018 Inductive Proofwriting Checklist In Handout 28, the Guide to Inductive Proofs, we outlined a number of specifc issues and concepts to be mindful about when

More information

Instances and Classes. SOFTWARE ENGINEERING Christopher A. Welty David A. Ferrucci. 24 Summer 1999 intelligence

Instances and Classes. SOFTWARE ENGINEERING Christopher A. Welty David A. Ferrucci. 24 Summer 1999 intelligence Instances and Classes in SOFTWARE ENGINEERING Christopher A. Welty David A. Ferrucci 24 Summer 1999 intelligence Software Engineering Over the past decade or so, one of the many areas that artificial intelligence

More information

Chapter No. 2 Class modeling CO:-Sketch Class,object models using fundamental relationships Contents 2.1 Object and Class Concepts (12M) Objects,

Chapter No. 2 Class modeling CO:-Sketch Class,object models using fundamental relationships Contents 2.1 Object and Class Concepts (12M) Objects, Chapter No. 2 Class modeling CO:-Sketch Class,object models using fundamental relationships Contents 2.1 Object and Class Concepts (12M) Objects, Classes, Class Diagrams Values and Attributes Operations

More information

EDMS. Architecture and Concepts

EDMS. Architecture and Concepts EDMS Engineering Data Management System Architecture and Concepts Hannu Peltonen Helsinki University of Technology Department of Computer Science Laboratory of Information Processing Science Abstract

More information

Graphical Interface and Application (I3305) Semester: 1 Academic Year: 2017/2018 Dr Antoun Yaacoub

Graphical Interface and Application (I3305) Semester: 1 Academic Year: 2017/2018 Dr Antoun Yaacoub Lebanese University Faculty of Science Computer Science BS Degree Graphical Interface and Application (I3305) Semester: 1 Academic Year: 2017/2018 Dr Antoun Yaacoub 2 Crash Course in JAVA Classes A Java

More information

MITOCW MIT6_01SC_rec2_300k.mp4

MITOCW MIT6_01SC_rec2_300k.mp4 MITOCW MIT6_01SC_rec2_300k.mp4 KENDRA PUGH: Hi. I'd like to talk to you today about inheritance as a fundamental concept in object oriented programming, its use in Python, and also tips and tricks for

More information

CS112 Lecture: Defining Classes. 1. To describe the process of defining an instantiable class

CS112 Lecture: Defining Classes. 1. To describe the process of defining an instantiable class CS112 Lecture: Defining Classes Last revised 2/3/06 Objectives: 1. To describe the process of defining an instantiable class Materials: 1. BlueJ SavingsAccount example project 2. Handout of code for SavingsAccount

More information

6.001 Notes: Section 1.1

6.001 Notes: Section 1.1 6.001 Notes: Section 1.1 Slide 1.1.1 This first thing we need to do is discuss the focus of 6.001. What is this course all about? This seems quite obvious -- this is a course about computer science. But

More information

Lecture 24: Implementing Heaps 10:00 AM, Mar 21, 2018

Lecture 24: Implementing Heaps 10:00 AM, Mar 21, 2018 CS18 Integrated Introduction to Computer Science Fisler Lecture 24: Implementing Heaps 10:00 AM, Mar 21, 2018 Contents 1 Recap on Heaps 1 1.1 The Heap Interface..................................... 1 2

More information

2. You are required to enter a password of up to 100 characters. The characters must be lower ASCII, printing characters.

2. You are required to enter a password of up to 100 characters. The characters must be lower ASCII, printing characters. BLACK BOX SOFTWARE TESTING SPRING 2005 DOMAIN TESTING LAB PROJECT -- GRADING NOTES For all of the cases below, do the traditional equivalence class and boundary analysis. Draw one table and use a new line

More information

COMP 250 Fall inheritance Nov. 17, 2017

COMP 250 Fall inheritance Nov. 17, 2017 Inheritance In our daily lives, we classify the many things around us. The world has objects like dogs and cars and food and we are familiar with talking about these objects as classes Dogs are animals

More information

Tuesday, October 4. Announcements

Tuesday, October 4. Announcements Tuesday, October 4 Announcements www.singularsource.net Donate to my short story contest UCI Delta Sigma Pi Accepts business and ICS students See Facebook page for details Slide 2 1 Design Patterns Design

More information

Programming in C++ Prof. Partha Pratim Das Department of Computer Science and Engineering Indian Institute of Technology, Kharagpur

Programming in C++ Prof. Partha Pratim Das Department of Computer Science and Engineering Indian Institute of Technology, Kharagpur Programming in C++ Prof. Partha Pratim Das Department of Computer Science and Engineering Indian Institute of Technology, Kharagpur Lecture - 31 Static Members Welcome to Module 16 of Programming in C++.

More information

1. Mesh Coloring a.) Assign unique color to each polygon based on the polygon id.

1. Mesh Coloring a.) Assign unique color to each polygon based on the polygon id. 1. Mesh Coloring a.) Assign unique color to each polygon based on the polygon id. Figure 1: The dragon model is shown rendered using a coloring scheme based on coloring each triangle face according to

More information

(I m not printing out these notes! Take your own.)

(I m not printing out these notes! Take your own.) PT1420 Week 2: Software Program Design I (I m not printing out these notes! Take your own.) Today we'll be discussing designing programs: Algorithms and errors Flowcharts and pseudocode Sequence structures

More information

2. The object-oriented paradigm

2. The object-oriented paradigm 2. The object-oriented paradigm Plan for this section: Look at things we have to be able to do with a programming language Look at Java and how it is done there Note: I will make a lot of use of the fact

More information

Safe and Secure Software. Ada An Invitation to. Conclusion. Courtesy of. John Barnes. The GNAT Pro Company

Safe and Secure Software. Ada An Invitation to. Conclusion. Courtesy of. John Barnes. The GNAT Pro Company Safe and Secure Software An Invitation to Ada 2005 Conclusion Courtesy of The GNAT Pro Company John Barnes It is hoped that this booklet will have proved interesting. It has covered a number of aspects

More information

Berkeley Scheme s OOP

Berkeley Scheme s OOP Page < 1 > Berkeley Scheme s OOP Introduction to Mutation If we want to directly change the value of a variable, we need a new special form, set! (pronounced set BANG! ). (set! )

More information

OBJECT-ORIENTED PROGRAMMING AND REPRESENTATION OF OBJECTS

OBJECT-ORIENTED PROGRAMMING AND REPRESENTATION OF OBJECTS STUDIES IN LOGIC, GRAMMAR AND RHETORIC 40(53) 2015 DOI: 10.1515/slgr-2015-0014 Adam Drozdek Duquesne University OBJECT-ORIENTED PROGRAMMING AND REPRESENTATION OF OBJECTS Abstract.Inthispaper,alessonisdrawnfromthewayclassdefinitionsare

More information

Why Fuzzy? Definitions Bit of History Component of a fuzzy system Fuzzy Applications Fuzzy Sets Fuzzy Boundaries Fuzzy Representation

Why Fuzzy? Definitions Bit of History Component of a fuzzy system Fuzzy Applications Fuzzy Sets Fuzzy Boundaries Fuzzy Representation Contents Why Fuzzy? Definitions Bit of History Component of a fuzzy system Fuzzy Applications Fuzzy Sets Fuzzy Boundaries Fuzzy Representation Linguistic Variables and Hedges INTELLIGENT CONTROLSYSTEM

More information

What is a class? Responding to messages. Short answer 7/19/2017. Code Listing 11.1 First Class. chapter 11. Introduction to Classes

What is a class? Responding to messages. Short answer 7/19/2017. Code Listing 11.1 First Class. chapter 11. Introduction to Classes chapter 11 Code Listing 11.1 First Class Introduction to Classes What is a class? If you have done anything in computer science before, you likely will have heard the term object oriented programming (OOP)

More information

CHAPTER 3: FUNDAMENTAL OF SOFTWARE ENGINEERING FOR GAMES.

CHAPTER 3: FUNDAMENTAL OF SOFTWARE ENGINEERING FOR GAMES. CHAPTER 3: FUNDAMENTAL OF SOFTWARE ENGINEERING FOR GAMES www.asyrani.com TOPICS COVERED C++ Review and Best Practices Data, Code, and Memory in C++ Catching and Handling Errors C++ REVIEW AND BEST PRACTICES

More information

CPS122 Lecture: From Python to Java

CPS122 Lecture: From Python to Java Objectives: CPS122 Lecture: From Python to Java last revised January 7, 2013 1. To introduce the notion of a compiled language 2. To introduce the notions of data type and a statically typed language 3.

More information

Classes, interfaces, & documentation. Review of basic building blocks

Classes, interfaces, & documentation. Review of basic building blocks Classes, interfaces, & documentation Review of basic building blocks Objects Data structures literally, storage containers for data constitute object knowledge or state Operations an object can perform

More information

General Architecture of HIVE/WARE

General Architecture of HIVE/WARE General Architecture of HIVE/WARE 1. Layman s Description One of the largest paradigm shifts in writing took place when we moved from the use of the typewriter to the use of the computer. Just as the typewriter

More information

Object-Oriented Analysis and Design Prof. Partha Pratim Das Department of Computer Science and Engineering Indian Institute of Technology-Kharagpur

Object-Oriented Analysis and Design Prof. Partha Pratim Das Department of Computer Science and Engineering Indian Institute of Technology-Kharagpur Object-Oriented Analysis and Design Prof. Partha Pratim Das Department of Computer Science and Engineering Indian Institute of Technology-Kharagpur Lecture 06 Object-Oriented Analysis and Design Welcome

More information

Notes on Turing s Theorem and Computability

Notes on Turing s Theorem and Computability Notes on Turing s Theorem and Computability Walter Neumann About 60 years ago there was a revolution in mathematics and philosophy. First Gödel and then Turing showed that there are impossible problems

More information

Artificial Intelligence Lecture 1

Artificial Intelligence Lecture 1 Artificial Intelligence Lecture 1 istrative Matters Webpage: www.aass.oru.se/~mbl/ai Examiner: Mathias Broxvall Assistant: Lia Susana d.c. Silva Lopez Schedule 20 hours/week on this course. 4 hours lectures,

More information

Zhifu Pei CSCI5448 Spring 2011 Prof. Kenneth M. Anderson

Zhifu Pei CSCI5448 Spring 2011 Prof. Kenneth M. Anderson Zhifu Pei CSCI5448 Spring 2011 Prof. Kenneth M. Anderson Introduction History, Characteristics of Java language Java Language Basics Data types, Variables, Operators and Expressions Anatomy of a Java Program

More information

Model-Based Design for Large High Integrity Systems: A Discussion Regarding Model Architecture

Model-Based Design for Large High Integrity Systems: A Discussion Regarding Model Architecture Model-Based Design for Large High Integrity Systems: A Discussion Regarding Model Architecture By Mike Anthony and Jon Friedman MathWorks Inc, Natick, MA, 01760 INTRODUCTION From complex controls problems

More information

This module presents the star schema, an alternative to 3NF schemas intended for analytical databases.

This module presents the star schema, an alternative to 3NF schemas intended for analytical databases. Topic 3.3: Star Schema Design This module presents the star schema, an alternative to 3NF schemas intended for analytical databases. Star Schema Overview The star schema is a simple database architecture

More information

(Refer Slide Time: 02.06)

(Refer Slide Time: 02.06) Data Structures and Algorithms Dr. Naveen Garg Department of Computer Science and Engineering Indian Institute of Technology, Delhi Lecture 27 Depth First Search (DFS) Today we are going to be talking

More information

Taxonomies and controlled vocabularies best practices for metadata

Taxonomies and controlled vocabularies best practices for metadata Original Article Taxonomies and controlled vocabularies best practices for metadata Heather Hedden is the taxonomy manager at First Wind Energy LLC. Previously, she was a taxonomy consultant with Earley

More information

Extension as the background of substance a formal approach

Extension as the background of substance a formal approach Extension as the background of substance a formal approach Bart lomiej Skowron Wroc law University The Pontifical University of John Paul II, Kraków bartlomiej.skowron@gmail.com February 11, 2013 Presentation

More information

Categorizing Migrations

Categorizing Migrations What to Migrate? Categorizing Migrations A version control repository contains two distinct types of data. The first type of data is the actual content of the directories and files themselves which are

More information

Recognizability Equals Definability for Graphs of Bounded Treewidth and Bounded Chordality

Recognizability Equals Definability for Graphs of Bounded Treewidth and Bounded Chordality Recognizability Equals Definability for Graphs of Bounded Treewidth and Bounded Chordality Hans L. Bodlaender, Utrecht University and Eindhoven University of Technology Pinar Heggernes, University of Bergen

More information

A macro- generator for ALGOL

A macro- generator for ALGOL A macro- generator for ALGOL byh.leroy Compagnie Bull-General Electric Paris, France INTRODUCfION The concept of macro-facility is ambiguous, when applied to higher level languages. For some authorsl,2,

More information

14.1 Encoding for different models of computation

14.1 Encoding for different models of computation Lecture 14 Decidable languages In the previous lecture we discussed some examples of encoding schemes, through which various objects can be represented by strings over a given alphabet. We will begin this

More information

Epimenides, Gödel, Turing: an Eternal Gölden Tangle [0]

Epimenides, Gödel, Turing: an Eternal Gölden Tangle [0] 2014-10-6 0 Epimenides, Gödel, Turing: an Eternal Gölden Tangle [0] Eric C.R. Hehner Department of Computer Science, University of Toronto hehner@cs.utoronto.ca Abstract: The Halting Problem is a version

More information

LABORATORY 1 REVISION

LABORATORY 1 REVISION UTCN Computer Science Department Software Design 2012/2013 LABORATORY 1 REVISION ================================================================== I. UML Revision This section focuses on reviewing the

More information

Principles of Algorithm Design

Principles of Algorithm Design Principles of Algorithm Design When you are trying to design an algorithm or a data structure, it s often hard to see how to accomplish the task. The following techniques can often be useful: 1. Experiment

More information

Lecture 3: Conditional Independence - Undirected

Lecture 3: Conditional Independence - Undirected CS598: Graphical Models, Fall 2016 Lecture 3: Conditional Independence - Undirected Lecturer: Sanmi Koyejo Scribe: Nate Bowman and Erin Carrier, Aug. 30, 2016 1 Review for the Bayes-Ball Algorithm Recall

More information

Chapter 1 Getting Started

Chapter 1 Getting Started Chapter 1 Getting Started The C# class Just like all object oriented programming languages, C# supports the concept of a class. A class is a little like a data structure in that it aggregates different

More information

Object-Oriented Design Lecture 21 CSU 370 Fall 2008 (Pucella) Tuesday, Dec 9, 2007

Object-Oriented Design Lecture 21 CSU 370 Fall 2008 (Pucella) Tuesday, Dec 9, 2007 Object-Oriented Design Lecture 21 CSU 370 Fall 2008 (Pucella) Tuesday, Dec 9, 2007 Odds and Ends In this lecture, I want to touch on a number of topics that are intrinsically useful, but that we do not

More information

MULTI-ATTRIBUTE VALUE FUNCTION FOR ORDERING WEB PAGES 1. INTRODUCTION. 1.1 The Problem Considered

MULTI-ATTRIBUTE VALUE FUNCTION FOR ORDERING WEB PAGES 1. INTRODUCTION. 1.1 The Problem Considered MULTI-ATTRIBUTE VALUE FUNCTION FOR ORDERING WEB PAGES 1. INTRODUCTION 1.1 The Problem Considered The Internet hosts a massive collection of web pages, and with the sheer volume of information available

More information

Programming Languages Third Edition

Programming Languages Third Edition Programming Languages Third Edition Chapter 12 Formal Semantics Objectives Become familiar with a sample small language for the purpose of semantic specification Understand operational semantics Understand

More information

Practical Object-Oriented Design in Ruby

Practical Object-Oriented Design in Ruby Practical Object-Oriented Design in Ruby Anyone that has done a decent amount of programming in Ruby is bound hear about the book Practical Object-Oriented Design in Ruby [1] (http://www.poodr.com/) by

More information

6.001 Notes: Section 15.1

6.001 Notes: Section 15.1 6.001 Notes: Section 15.1 Slide 15.1.1 Our goal over the next few lectures is to build an interpreter, which in a very basic sense is the ultimate in programming, since doing so will allow us to define

More information

Semantic Web. Ontology Engineering and Evaluation. Morteza Amini. Sharif University of Technology Fall 95-96

Semantic Web. Ontology Engineering and Evaluation. Morteza Amini. Sharif University of Technology Fall 95-96 ه عا ی Semantic Web Ontology Engineering and Evaluation Morteza Amini Sharif University of Technology Fall 95-96 Outline Ontology Engineering Class and Class Hierarchy Ontology Evaluation 2 Outline Ontology

More information

DISCRETE COMPUTER SIMULATION WITH JAVA

DISCRETE COMPUTER SIMULATION WITH JAVA DISCRETE COMPUTER SIMULATION WITH JAVA Ricardo Augusto Cassel Department of Management Science - The Management School - Lancaster University Lancaster, LA1 4YX, United Kingdom Michael Pidd Department

More information

Introduction to Design Patterns

Introduction to Design Patterns Introduction to Design Patterns First, what s a design pattern? a general reusable solution to a commonly occurring problem within a given context in software design It s not a finished design that can

More information

Typing Control. Chapter Conditionals

Typing Control. Chapter Conditionals Chapter 26 Typing Control 26.1 Conditionals Let s expand our language with a conditional construct. We can use if0 like before, but for generality it s going to be more convenient to have a proper conditional

More information

Type Checking and Type Equality

Type Checking and Type Equality Type Checking and Type Equality Type systems are the biggest point of variation across programming languages. Even languages that look similar are often greatly different when it comes to their type systems.

More information

Common Lisp Object System Specification. 1. Programmer Interface Concepts

Common Lisp Object System Specification. 1. Programmer Interface Concepts Common Lisp Object System Specification 1. Programmer Interface Concepts Authors: Daniel G. Bobrow, Linda G. DeMichiel, Richard P. Gabriel, Sonya E. Keene, Gregor Kiczales, and David A. Moon. Draft Dated:

More information