Results 1  10
of
10
Phobos: A frontend approach to extensible compilers
, 2003
"... This paper describes a practical approach for implementing domainspecific languages with extensible compilers. Given a compiler with one or more frontend languages, we introduce the idea of a "generic" frontend that allows the syntactic and semantic specification of domainspecific langu ..."
Abstract

Cited by 14 (9 self)
 Add to MetaCart
(Show Context)
This paper describes a practical approach for implementing domainspecific languages with extensible compilers. Given a compiler with one or more frontend languages, we introduce the idea of a "generic" frontend that allows the syntactic and semantic specification of domainspecific languages. Phobos, our generic frontend, offers modular language specification, allowing the programmer to define new syntax and semantics incrementally.
MetaPRL  A Modular Logical Environment
, 2003
"... MetaPRL is the latest system to come out of over twenty five years of research by the Cornell PRL group. While initially created at Cornell, MetaPRL is currently a collaborative project involving several universities in several countries. The MetaPRL system combines the properties of an interactive ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
(Show Context)
MetaPRL is the latest system to come out of over twenty five years of research by the Cornell PRL group. While initially created at Cornell, MetaPRL is currently a collaborative project involving several universities in several countries. The MetaPRL system combines the properties of an interactive LCFstyle tacticbased proof assistant, a logical framework, a logical programming environment, and a formal methods programming toolkit. MetaPRL is distributed under an opensource license and can be downloaded from http://metaprl.org/. This paper provides an overview of the system focusing on the features that did not exist in the previous generations of PRL systems.
JProver: Integrating connectionbased theorem proving into interactive proof assistants
 IJCAR’01, volume 2083 of LNAI
, 2001
"... Abstract. JProver is a firstorder intuitionistic theorem prover that creates sequentstyle proof objects and can serve as a proof engine in interactive proof assistants with expressive constructive logics. This paper gives a brief overview of JProver’s proof technique, the generation of proof objec ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
(Show Context)
Abstract. JProver is a firstorder intuitionistic theorem prover that creates sequentstyle proof objects and can serve as a proof engine in interactive proof assistants with expressive constructive logics. This paper gives a brief overview of JProver’s proof technique, the generation of proof objects, and its integration into the Nuprl proof development system. 1
FDL: A prototype formal digital library. PostScript document on website
, 2002
"... Digital Library (FDL). We designed the system and assembled the prototype as part of a ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
Digital Library (FDL). We designed the system and assembled the prototype as part of a
PRIVACY PRESERVING INFORMATION SHARING
, 2004
"... Modern business creates an increasing need for sharing, querying and mining information across autonomous enterprises while maintaining privacy of their own data records. The capability of preserving privacy in query processing algorithms can be demonstrated in two ways: through statistics and throu ..."
Abstract
 Add to MetaCart
(Show Context)
Modern business creates an increasing need for sharing, querying and mining information across autonomous enterprises while maintaining privacy of their own data records. The capability of preserving privacy in query processing algorithms can be demonstrated in two ways: through statistics and through cryptography. Statistical approach evaluates disclosure by its effect on an adversary’s probability assumptions regarding privacysensitive data properties, while cryptographic approach gives comparative lower bounds on the computational complexity of learning these properties. This dissertation presents results in both approaches. First, it considers the setup with one central server and a large number of clients connected only to the server, each client having a private data record. The server wants to generate an aggregate model of clients ’ data, and the clients want to limit disclosure of their individual records. Before sending to the server, each client hides its record using randomization, i.e. replaces the record with another one drawn from a certain distribution that depends on the original record. Disclosure is limited statistically by providing guarantees against “privacy breaches”: situations when the randomized record significantly alters the server’s probability
JProver: Integrating Connectionbased Theorem Proving into Interactive Proof Assistants
"... Abstract. JProver is a firstorder intuitionistic theorem prover that creates sequentstyle proof objects and can serve as a proof engine in interactive proof assistants with expressive constructive logics. This paper gives a brief overview of JProver's proof technique, the generation of proof ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract. JProver is a firstorder intuitionistic theorem prover that creates sequentstyle proof objects and can serve as a proof engine in interactive proof assistants with expressive constructive logics. This paper gives a brief overview of JProver's proof technique, the generation of proof objects, and its integration into the Nuprl proof development system. 1 Introduction In large scale applications of automated reasoning, interactive proof assistants such as Coq, HOL, Isabelle, Nuprl, and PVS are the tools of choice. Because of their expressive logics, they are more generally applicable than firstorder tools, yet at a much lesser degree of automation. JProver was developed in an effort to combine the expressive power of interactive proof assistants with the automatic capabilities of firstorder theorem proving, both for reasoning about mathematics and for reasoning about programs. It provides a theorem prover for firstorder intuitionistic and classical logic based on the connection method [3,10], a tool for generating proof objects in the style of sequent proofs [11], and is coupled with mechanisms for integrating the prover into the Nuprl proof/program development system [4,1] and the MetaPRL proof environment [8,9]. These components enable a user to invoke the automatic prover on proof goals that can be solved by firstorder reasoning while using the expressive logic of the proof assistant for the more demanding proof parts. Furthermore, the proof information returned by JProver enables the proof assistant to build a valid proof in its own calculus.
unknown title
"... Phobos: A frontend approach to extensible compilers This paper describes a practical approach for implementing domainspecific languages with extensible compilers. Given a compiler with one or more frontend languages, we introduce the idea of a “generic ” frontend that allows the syntactic and se ..."
Abstract
 Add to MetaCart
(Show Context)
Phobos: A frontend approach to extensible compilers This paper describes a practical approach for implementing domainspecific languages with extensible compilers. Given a compiler with one or more frontend languages, we introduce the idea of a “generic ” frontend that allows the syntactic and semantic specification of domainspecific languages. Phobos, our generic frontend, offers modular language specification, allowing the programmer to define new syntax and semantics incrementally. A key feature of our approach is the use of an open term language that can be used to describe arbitrary syntax, and the use of a term rewriting engine to encode semantic actions. The term language is expressive. Scoping can be defined explicitly, and term rewrites use secondorder substitution, allowing the use of higherorder abstract syntax if needed. Given a language specification and a source string, the generic frontend constructs a pushdown automaton (PDA) based on the supplied grammar, lexes the source string, and simulates the constructed PDA with the stream of tokens obtained. During parsing, rewrite rules associated with grammar productions are executed, producing a single term when the PDA accepts. This term is then converted via further rewriting into a compiler representation and compilation proceeds to generate executable code. 1
Reflection and PropositionsasTypes
"... Reection is the ability of a deductive system to internalize aspects of its own structure and thereby reason to some extent about itself. In this paper we present a theoretical framework for exploring reection in type theories that use the \PropositionsasTypes" principle, such as MartinL ..."
Abstract
 Add to MetaCart
Reection is the ability of a deductive system to internalize aspects of its own structure and thereby reason to some extent about itself. In this paper we present a theoretical framework for exploring reection in type theories that use the \PropositionsasTypes" principle, such as MartinLof style theories. One of the main results is that it is unnecessary to build a complete Godel style \reection" layer on top of the logical theory. This makes it possible to use our framework for an ecient implementation of reection in theorem provers for such type theories. We are doing this for the NuPRL and MetaPRL systems.
Implementing the Calculus of Inductive Constructions in the MetaPRL Framework
"... Abstract. The Calculus of Inductive Constructions is an underlying logic of the Coq proof assistant — a widely used mature proof assistant. In this paper we present our work on implementing the Calculus of Inductive Constructions in theMetaPRL logical framework. Rules from the Coq reference manual ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract. The Calculus of Inductive Constructions is an underlying logic of the Coq proof assistant — a widely used mature proof assistant. In this paper we present our work on implementing the Calculus of Inductive Constructions in theMetaPRL logical framework. Rules from the Coq reference manual have quite unrestricted format so we have to make certain design decisions in order to express those rules in the plain Gentzen style supported by MetaPRL. The most complicated caseanalysis and fixpoint rules have yet to be implemented. There is a working implementation with rudimentary proof automation; the toy example of inductive definition (parameterized lists) is typechecked. 1