WorldCat Identities

Harper, Robert

Overview
Works: 48 works in 205 publications in 1 language and 1,488 library holdings
Genres: Conference papers and proceedings 
Roles: Author, Editor, Other, Creator
Classifications: QA76.73.M6, 005.133
Publication Timeline
.
Most widely held works by Robert Harper
The definition of Standard ML by R Milner( Book )

19 editions published between 1988 and 1990 in English and held by 326 WorldCat member libraries worldwide

Types in compilation : third international workshop, TIC 2000, Montreal, Canada, September 21, 2000 : revised selected papers by Robert William Harper( Book )

25 editions published in 2001 in English and held by 257 WorldCat member libraries worldwide

This book constitutes the thoroughly refereed post-proceedings of the Third International Workshop on Types in Compilation, TIC 2000, held in Montreal, Canada in September 2000. The seven revised full papers presented have been carefully reviewed and selected from the workshop papers for inclusion in the book. The book focuses on the application of types in the implementation of programming languages. Among the topics addressed are intersection and union types, elimination, Java dynamic linking and loading, typed Assembly language, dynamic linking of native code, and type for recursive data structures
Practical foundations for programming languages by Robert William Harper( Book )

25 editions published between 2012 and 2016 in English and held by 180 WorldCat member libraries worldwide

"This book offers a fresh perspective on the fundamentals of programming languages through the use of type theory"--
An inaugural dissertation on cholera ... by Robert William Harper( Book )

7 editions published in 1815 in English and held by 132 WorldCat member libraries worldwide

A framework for defining logics by Robert William Harper( Book )

16 editions published between 1987 and 1991 in English and held by 34 WorldCat member libraries worldwide

This allows for a smooth treatment of discharge and variable occurrence conditions and leads to a uniform treatment of rules and proofs whereby rules are viewed as proofs of higher-order judgements and proof checking is reduced to type checking. The practical benefit of our treatment of formal systems is that logic-independent tools such as proof editors and proof checkers can be constructed."
Higher-order modules and the phase distinction by Robert William Harper( Book )

9 editions published between 1989 and 1990 in English and held by 18 WorldCat member libraries worldwide

Abstract: "In earlier work, we used a typed function calculus, XML, with dependent types to analyze several aspects of the Standard ML type system. In this paper, we introduce a refinement of XML with a clear compile-time/run-time phase distinction, and a direct compile-time type checking algorithm. The calculus uses a finer separation of types into universes than XML and enforces the phase distinction using a nonstandard equational theory for module and signature expressions. While unusual from a type-theoretic point of view, the nonstandard equational theory arises naturally from the well-known Grothendieck construction on an indexed category."
Introduction to Standard ML by Robert William Harper( Book )

8 editions published between 1986 and 1989 in English and held by 16 WorldCat member libraries worldwide

Structure and representation in LF by Robert William Harper( Book )

7 editions published in 1989 in English and Undetermined and held by 14 WorldCat member libraries worldwide

Abstract: "The purpose of a logical framework such as LF is to provide a language for defining logical systems suitable for use in a logic-independent proof development environment. All inferential activity in an object logic (in particular, proof search) is to be conducted in the logical framework via the representation of that logic in the framework. An important tool for controlling search in an object logic is the use of structured theory presentations. In order to apply these ideas to the setting of a logical framework, we study the behavior of structured theory presentations under representation in a framework, focusing on the problem of "lifting" presentations form the object logic to the metalogic of the framework. We also consider imposing structure on logic presentations so that logical systems may themselves be defined in a modular fashion. This opens the way to a CLEAR-like language for defining both theories and logics in a logical framework."
An inaugural dissertation on cholera by Robert William Harper( )

1 edition published in 1815 in English and held by 11 WorldCat member libraries worldwide

On the type structure of standard ML by Robert William Harper( Book )

4 editions published in 1990 in English and held by 10 WorldCat member libraries worldwide

In this setting, implicitly-typed core language expressions are regarded as a convenient short-hand for an explicitly-typed counterpart in our function calculus. In contrast to the Girard-Reynolds approach to polymorphism, our function calculus is predicative: the type system may be built up by induction on type levels. We show that, in a precise sense, the language becomes inconsistent if restrictions imposed by type levels are relaxed. More specifically, we prove that the important programming features of ML cannot be added to any impredicative language, such as the Girard-Reynolds calculus, without implicitly assuming a type of all types."
Extensible records without subsumption by Robert William Harper( Book )

3 editions published in 1990 in English and held by 9 WorldCat member libraries worldwide

Abstract "We present a calculus of operations on extensible records, based on a polymorphic lambda calculus with constrained quantification. This system is related to Cardelli and Mitchell's calculus of operations on records, but expresses constraints on record operations using explicit predicates on types rather than a subtype relation."
Logic representation by Robert William Harper( Book )

3 editions published in 1989 in English and Undetermined and held by 8 WorldCat member libraries worldwide

Following standard practice, we distinguish two types of logical system of open formulae that differ in the treatment of free variables, and show how they may be induced from a logical system of closed sentences. The technical notions of a logic presentation and a uniform encoding of a logical system in LF are generalized to the present setting."
Typing first-class continuations in ML by Bruce F Duba( Book )

4 editions published in 1990 in English and held by 8 WorldCat member libraries worldwide

Abstract: "An extension of Standard ML with continuation primitives similar to those found in Scheme is considered. A number of alternative type systems are discussed, and several programming examples are given. The semantics of type assignment for a small, purely functional fragment of the language is presented, for which both a Milner-style soundness theorem and an observational soundness theorem may be established."
Polymorphic type assignment and CPS conversion by Robert William Harper( Book )

3 editions published in 1992 in English and held by 8 WorldCat member libraries worldwide

We prove that there is no call-by-value CPS transform for the full Damas-Milner language that validates the Meyer-Wand typing property and is equivalent to the standard call-by-value transform up to [beta][eta]- conversion."
Systems of polymorphic type assignment in LF by Robert William Harper( Book )

3 editions published in 1990 in English and held by 8 WorldCat member libraries worldwide

Abstract: "Several formulations of type assignment of the Damas-Milner language are studied, with a view toward their formalization in the logical framework LF, and the suitability of these encodings for direct execution by the logic programming language Elf."
Aspects of the implementation of type theory by Robert William Harper( Book )

4 editions published in 1985 in English and held by 7 WorldCat member libraries worldwide

ABSTRACT NOT SUPPLIED
Abstract models of memory management by G Morrisett( Book )

3 editions published in 1995 in English and held by 7 WorldCat member libraries worldwide

Abstract: "Most specifications of garbage collectors concentrate on the low-level algorithmic details of how to find and preserve accessible objects. Often, they focus on bit-level manipulations such as 'scanning stack frames, ' 'marking objects, ' 'tagging data, ' etc. While these details are important in some contexts, they often obscure the more fundamental aspects of memory management: what objects are garbage and why? We develop a series of calculi that are just low-level enough that we can express allocation and garbage collection, yet are sufficiently abstract that we may formally prove the correctness of various memory management strategies. By making the heap of a program syntactically apparent, we can specify memory actions as rewriting rules that allocate values on the heap and automatically dereference pointers to such objects when needed. This formulation permits the specification of garbage collection as a relation that removes portions of the heap without affecting the outcome of the evaluation. Our high-level approach allows us to compactly specify and prove correct a wide variety of memory management techniques, including standard trace-based garbage collectors (i.e., the family of copying and mark/sweep collectors), generational collection, and type-based tag-free collection. Furthermore, since the definition of garbage is based on the semantics of the underlying language instead of the conservative approximation of inaccessibility, we are able to specify and formally prove the idea that type inference can be used to collect some objects that are accessible but never used."
A module system for a programming language based on the LF logical framework by Robert William Harper( Book )

3 editions published in 1992 in English and held by 7 WorldCat member libraries worldwide

Abstract: "We describe a module system for Elf, a logic programming language based on the LF logical framework. The static part of module calculus addresses name-space management and structured presentation of deductive systems. The dynamic part addresses search-space management and modularization of logic programs."
Explicit polymorphism and CPS conversion by Robert William Harper( Book )

3 editions published in 1992 in English and held by 6 WorldCat member libraries worldwide

Compositional, type-preserving CPS transformation algorithms are given for the standard strategies, resulting in terms on which all evaluation strategies coincide. This has as a corollary the soundness and termination of well-typed programs under the standard evaluation strategies. A similar result is obtained for the ML-like call-by-name strategy. In contrast, such results are obtained for the call-by value [sic] ML-like strategy only for a restricted sub-language in which constructor abstractions are limited to values."
Proceedings of the first ACM SIGPLAN international conference on Functional programming by Robert William Harper( )

2 editions published in 1996 in English and held by 0 WorldCat member libraries worldwide

 
moreShow More Titles
fewerShow Fewer Titles
Audience Level
0
Audience Level
1
  Kids General Special  
Audience level: 0.67 (from 0.61 for Practical ... to 0.91 for An inaugur ...)

The definition of Standard ML
Alternative Names
Harper, R. 1957-

Harper, R. W. 1957-

Harper, Robert W. 1957-

Harper, Robert William 1957-

Harper, Robert William 1957- Jr

Harper, Robert William Jr. 1957-

Robert Harper Computer scientist

Роберт Харпер

Languages
English (150)

Covers
Types in compilation : third international workshop, TIC 2000, Montreal, Canada, September 21, 2000 : revised selected papers