Results 1  10
of
18
Extending ObjectOriented Design for Physical Modeling
, 1996
"... When we build simulation models and construct dynamical models for physical systems, we often do not do so using a clear overall framework that organizes our geometry, dynamics and models. How do geometry and dynamics intertwine to effect system change over multiple abstraction levels? We present a ..."
Abstract

Cited by 11 (2 self)
 Add to MetaCart
(Show Context)
When we build simulation models and construct dynamical models for physical systems, we often do not do so using a clear overall framework that organizes our geometry, dynamics and models. How do geometry and dynamics intertwine to effect system change over multiple abstraction levels? We present a methodology, called objectoriented physical modeling (OOPM), which builds on the currently accepted computer science approach in objectoriented program design. This type of modeling injects a way of incorporating geometry and dynamics into general objectoriented design. Moreover, we present an approach to dynamical modeling that mirrors major categories of computer programming languages, thereby achieving a definition of system modeling that reinforces the relation of model to program.
A Taxonomy for Simulation Modeling Based on Programming Language Principles
, 1996
"... We present a new modeling taxonomy for computer simulation. The importance of this work centers on a cohesive approach to modeling that attempts to unify heretofore disparate modeling techniques. For example, while there exists a taxonomy for discrete event simulation, this taxonomy does not incorpo ..."
Abstract

Cited by 7 (3 self)
 Add to MetaCart
We present a new modeling taxonomy for computer simulation. The importance of this work centers on a cohesive approach to modeling that attempts to unify heretofore disparate modeling techniques. For example, while there exists a taxonomy for discrete event simulation, this taxonomy does not incorporate models whose execution is via continuous time increment. The modeling taxonomy has a similar structure to computer language categories: declarative, functional and constraint. The multimodeling model type permits the creation of a multilevel heterogeneous model that can integrate different model types, rather than displacing them in favor of a singular modeling method. Instead of advocating the removal of existing modeling techniques, our focus has been on organizing modeling techniques from different disciplines to yield unification.
A Visual ObjectOriented Multimodeling Design Approach for Physical Modeling
 ACM TRANSACTIONS ON MODELING AND COMPUTER SIMULATION
, 1996
"... We present a design approach for structuring multimodels in an objectoriented framework for physical modeling. This approach is termed objectoriented physical modeling (OOPM). Multimodels have played a key role in permitting a model designer to construct largescale dynamical models. We have built ..."
Abstract

Cited by 5 (4 self)
 Add to MetaCart
(Show Context)
We present a design approach for structuring multimodels in an objectoriented framework for physical modeling. This approach is termed objectoriented physical modeling (OOPM). Multimodels have played a key role in permitting a model designer to construct largescale dynamical models. We have built upon earlier work in multimodeling by specifying how multimodels are defined for objectoriented model designs. The objectoriented approach permits class reusability and a more efficient method for designing multimodels. By using basic physical categories, such as pointmass and manyparticle system as metaphors, we explain the use of this new approach to modeling.
Conceptual Content Management for Software Engineering Processes
 In 9th East European Conference, ADBIS 2005, volume 3631 of LNCS
, 2005
"... Abstract. A major application area of information systems technology and multimedia content management is that of support systems for engineering processes. This includes the particularly important area of software engineering. Effective support of software engineering processes requires large amoun ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
(Show Context)
Abstract. A major application area of information systems technology and multimedia content management is that of support systems for engineering processes. This includes the particularly important area of software engineering. Effective support of software engineering processes requires large amounts of content (texts, diagrams, code, data, executables etc.) from different conceptual domains. The term “software crisis ” disappeared gradually when content modelling and management addressed domains from application analysis and system design in addition to the sheer computational code domain. In this paper we introduce an innovative conceptual content model and apply it in support of software engineering processes and their artefacts. We base our approach on the core model of the computational domain which abstracts computational content (bodies of function code) by the computational concept of signatures (lists of typed function parameters). We generalise this functional abstraction model beyond the computational domain by introducing the notion of asset abstraction which models entities domainindependently by general contentconcept pairs. We introduce an asset language and discuss the essentials of an asset system implementation. In the application part of the paper we argue that software engineering can be substantially simplified by modelling SE entities from all the domains involved in an SE process homogeneously in an assetoriented approach—entities ranging from application domains over intermediate architectural and design domains down to the computational domain. Furthermore, we discuss how the mappings between such domains can be substantially supported by services based on assetoriented information systems.
What is an Efficient Implementation of the λcalculus?
, 1991
"... We propose to measure the efficiency of any implementation of the λcalculus as a function of a new parameter ν, that is itself a function of any λexpression. Complexity is expressed here as a function of ν just as runtime is expressed as a function of the input size n in ordinary analysis of algori ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
We propose to measure the efficiency of any implementation of the λcalculus as a function of a new parameter ν, that is itself a function of any λexpression. Complexity is expressed here as a function of ν just as runtime is expressed as a function of the input size n in ordinary analysis of algorithms. This enables implementations to be compared for worst case efficiency. We argue that any implementation must have complexity Ω(ν), i.e. a linear lower bound. Furthermore, we show that implementations based upon Turner Combinators or Hughes Supercombinators have complexities 2 Ω(ν), i.e. an exponential lower bound. It is open whether any implementation of polynomial complexity, ν O(1), exists, although some implementations have been implicitly claimed to have this complexity.
Lecture Notes on the Lambda Calculus
"... This is a set of lecture notes that developed out of courses on the lambda calculus that I taught at the University of Ottawa in 2001 and at Dalhousie University in 2007. Topics covered in these notes include the untyped lambda calculus, the ChurchRosser theorem, combinatory algebras, the simplyty ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
This is a set of lecture notes that developed out of courses on the lambda calculus that I taught at the University of Ottawa in 2001 and at Dalhousie University in 2007. Topics covered in these notes include the untyped lambda calculus, the ChurchRosser theorem, combinatory algebras, the simplytyped lambda calculus, the CurryHoward isomorphism, weak and strong normalization, type inference, denotational semantics, complete partial orders, and the language PCF. Contents 1
Developing error handling software for objectoriented geographical information
, 1999
"... I declare that this thesis is entirely the product of my own work, except where indicated, and has not been submitted by myself or any other person for any degree at this or any other university or college. ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
I declare that this thesis is entirely the product of my own work, except where indicated, and has not been submitted by myself or any other person for any degree at this or any other university or college.
A Model for a Listoriented Extension of the Lambda Calculus
, 1997
"... This work is intended to provide a semantics for a fragment of a programming language described by Gyorgy R'ev'esz in [R'ev88], for which no model was known. We begin with a brief presentation of the syntax of the lambda calculus and some relevant extensions. We then describe a class ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
This work is intended to provide a semantics for a fragment of a programming language described by Gyorgy R'ev'esz in [R'ev88], for which no model was known. We begin with a brief presentation of the syntax of the lambda calculus and some relevant extensions. We then describe a class of complete lattices and use them as models for the lambda calculus. We then find specialized sublattices which we use as models for the extensions of the lambda calculus, thus achieving the original goal of finding a semantics for R'ev'esz's language.
A Tutorial Introduction to the Lambda Calculus
"... This paper is a short and painless introduction to the λ calculus. Originally ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
This paper is a short and painless introduction to the λ calculus. Originally
Objectives
, 1991
"... We propose to measure the efficiency of any implementation of the λcalculus as a function of a new parameter ν, that is itself a function of any λexpression. Complexity is expressed here as a function of ν just as runtime is expressed as a function of the input size n in ordinary analysis of algor ..."
Abstract
 Add to MetaCart
We propose to measure the efficiency of any implementation of the λcalculus as a function of a new parameter ν, that is itself a function of any λexpression. Complexity is expressed here as a function of ν just as runtime is expressed as a function of the input size n in ordinary analysis of algorithms. This enables implementations to be compared for worst case efficiency. We argue that any implementation must have complexity Ω(ν), i.e. a linear lower bound. Furthermore, we show that implementations based upon Turner Combinators or Hughes Supercombinators have complexities 2Ω(ν), i.e. an exponential lower bound. It is open whether any implementation of polynomial complexity, νO(1), exists, although some implementations have been implicitly claimed to have this complexity. 2