Scott F. Smith

Bio: Scott F. Smith is an academic researcher from Johns Hopkins University. The author has contributed to research in topics: Type inference & Type safety. The author has an hindex of 28, co-authored 93 publications receiving 4363 citations. Previous affiliations of Scott F. Smith include Cornell University & Kelowna General Hospital.

Implementing Mathematics with The Nuprl Proof Development System

Abstract: If looking for the ebook Implementing Mathematics with The Nuprl Proof Development System by R L Constable in pdf form, in that case you come on to the right site. We present full variant of this ebook in DjVu, PDF, ePub, doc, txt forms. You can reading Implementing Mathematics with The Nuprl Proof Development System online by R L Constable either downloading. Additionally to this ebook, on our website you may read guides and different art eBooks online, either download their. We wish to invite your note what our site does not store the book itself, but we grant url to website wherever you may load either reading online. So that if want to load pdf Implementing Mathematics with The Nuprl Proof Development System by R L Constable, then you have come on to correct website. We have Implementing Mathematics with The Nuprl Proof Development System txt, ePub, PDF, doc, DjVu forms. We will be pleased if you go back afresh.

A foundation for actor computation

Abstract: We present an actor language which is an extension of a simple functional language, and provide an operational semantics for this extension. Actor configurations represent open distributed systems, by which we mean that the specification of an actor system explicitly takes into account the interface with external components. We study the composability of such systems. We define and study various notions of testing equivalence on actor expressions and configurations. The model we develop provides fairness. An important result is that the three forms of equivalence, namely, convex, must, and may equivalences, collapse to two in the presence of fairness. We further develop methods for proving laws of equivalence and provide example proofs to illustrate our methodology.

Sound polymorphic type inference for objects

Abstract: A polymorphic, constraint-based type inference algorithm for an object-oriented language is defined. A generalized form of type, polymorphic recursively constrained types, are inferred. These types are expressive enough for typing objects, since they generalize recursive types and F-bounded polymorphism. The well-known tradeoff between inheritance and subtyping is mitigated by the type inference mechanism. Soundness and completeness of type inference are established.

Phd by thesis

Abstract: Deposits of clastic carbonate-dominated (calciclastic) sedimentary slope systems in the rock record have been identified mostly as linearly-consistent carbonate apron deposits, even though most ancient clastic carbonate slope deposits fit the submarine fan systems better. Calciclastic submarine fans are consequently rarely described and are poorly understood. Subsequently, very little is known especially in mud-dominated calciclastic submarine fan systems. Presented in this study are a sedimentological core and petrographic characterisation of samples from eleven boreholes from the Lower Carboniferous of Bowland Basin (Northwest England) that reveals a >250 m thick calciturbidite complex deposited in a calciclastic submarine fan setting. Seven facies are recognised from core and thin section characterisation and are grouped into three carbonate turbidite sequences. They include: 1) Calciturbidites, comprising mostly of highto low-density, wavy-laminated bioclast-rich facies; 2) low-density densite mudstones which are characterised by planar laminated and unlaminated muddominated facies; and 3) Calcidebrites which are muddy or hyper-concentrated debrisflow deposits occurring as poorly-sorted, chaotic, mud-supported floatstones. These

Types and Programming Languages

Abstract: A type system is a syntactic method for automatically checking the absence of certain erroneous behaviors by classifying program phrases according to the kinds of values they compute. The study of type systems -- and of programming languages from a type-theoretic perspective -- has important applications in software engineering, language design, high-performance compilers, and security.This text provides a comprehensive introduction both to type systems in computer science and to the basic theory of programming languages. The approach is pragmatic and operational; each new concept is motivated by programming examples and the more theoretical sections are driven by the needs of implementations. Each chapter is accompanied by numerous exercises and solutions, as well as a running implementation, available via the Web. Dependencies between chapters are explicitly identified, allowing readers to choose a variety of paths through the material.The core topics include the untyped lambda-calculus, simple type systems, type reconstruction, universal and existential polymorphism, subtyping, bounded quantification, recursive types, kinds, and type operators. Extended case studies develop a variety of approaches to modeling the features of object-oriented languages.

A combined quantum mechanical and molecular mechanical potential for molecular dynamics simulations

Abstract: A combined quantum mechanical (QM) and molecular mechanical (MM) potential has been developed for the study of reactions in condensed phases. For the quantum mechanical calculations semiempirical methods of the MNDO and AM1 type are used, while the molecular mechanics part is treated with the CHARMM force field. Specific prescriptions are given for the interactions between the QM and MM portions of the system; cases in which the QM and MM methodology is applied to parts of the same molecule or to different molecules are considered. The details of the method and a range of test calculations, including comparisons with ab initio and experimental results, are given. It is found that in many cases satisfactory results are obtained. However, there are limitations to this type of approach, some of which arise from the AM1 or MNDO methods themselves and others from the present QM/MM implementation. This suggests that it is important to test the applicability of the method to each particular case prior to its use. Possible areas of improvement in the methodology are discussed.

QM/MM Methods for Biomolecular Systems

Abstract: Combined quantum-mechanics/molecular-mechanics (QM/MM) approaches have become the method of choice for modeling reactions in biomolecular systems. Quantum-mechanical (QM) methods are required for describing chemical reactions and other electronic processes, such as charge transfer or electronic excitation. However, QM methods are restricted to systems of up to a few hundred atoms. However, the size and conformational complexity of biopolymers calls for methods capable of treating up to several 100,000 atoms and allowing for simulations over time scales of tens of nanoseconds. This is achieved by highly efficient, force-field-based molecular mechanics (MM) methods. Thus to model large biomolecules the logical approach is to combine the two techniques and to use a QM method for the chemically active region (e.g., substrates and co-factors in an enzymatic reaction) and an MM treatment for the surroundings (e.g., protein and solvent). The resulting schemes are commonly referred to as combined or hybrid QM/MM methods. They enable the modeling of reactive biomolecular systems at a reasonable computational effort while providing the necessary accuracy.