• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 60
Next 10 →

SUBSEXPL: a Tool for Simulating and Comparing Explicit Substitutions Calculi

by Flávio L C De Moura , Mauricio Ayala-Rincón , Fairouz Kamareddine - Proc. 6th IEEE Symp , 2006
"... Abstract In this tutorial we present the system SUBSEXPL that is used for simulating and comparing explicit substitutions calculi. This framework was developed in Ocaml, a language of the ML family, and it allows the manipulation of expressions of the λ-calculus and of several styles of explicit su ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
Abstract In this tutorial we present the system SUBSEXPL that is used for simulating and comparing explicit substitutions calculi. This framework was developed in Ocaml, a language of the ML family, and it allows the manipulation of expressions of the λ-calculus and of several styles of explicit

† Supported by the Brazilian Ministry Educational Council CAPES.

by Brasília D. F
"... SUBSEXPL: a tool for simulating and comparing explicit substitutions calculi 1 ..."
Abstract - Add to MetaCart
SUBSEXPL: a tool for simulating and comparing explicit substitutions calculi 1

SUBSEXPL: A Framework for Simulating and Comparing Explicit Substitutions Calculi A Tutorial

by Flávio L. C. Moura, Mauricio Ayala-rincón, Fairouz Kamareddine , 2005
"... In this paper we present a framework, called SUBSEXPL, for simulating and comparing explicit substitutions calculi. This framework was developed in Ocaml, a language of the ML family, and it allows the manipulation of expressions of the λ-calculus and of several styles of explicit substitutions calc ..."
Abstract - Cited by 1 (1 self) - Add to MetaCart
In this paper we present a framework, called SUBSEXPL, for simulating and comparing explicit substitutions calculi. This framework was developed in Ocaml, a language of the ML family, and it allows the manipulation of expressions of the λ-calculus and of several styles of explicit substitutions

Relating the λσ- and λs-styles of explicit substitutions

by Fairouz Kamareddine, Alejandro Rios - JOURNAL OF LOGIC AND COMPUTATION , 2000
"... The aim of this article is to compare two styles of Explicit Substitutions: the - and s-styles. We start by introducing a criterion of adequacy to simulate -reduction in calculi of explicit substitutions and we apply it to several calculi: , * , , s, t and u. The latter is presented here for the rs ..."
Abstract - Cited by 9 (5 self) - Add to MetaCart
The aim of this article is to compare two styles of Explicit Substitutions: the - and s-styles. We start by introducing a criterion of adequacy to simulate -reduction in calculi of explicit substitutions and we apply it to several calculi: , * , , s, t and u. The latter is presented here

likelihood and the role of models in molecular phylogenetics.

by Mike Steel , David Penny - Mol. Biol. Evol. , 2000
"... Methods such as maximum parsimony (MP) are frequently criticized as being statistically unsound and not being based on any ''model.'' On the other hand, advocates of MP claim that maximum likelihood (ML) has some fundamental problems. Here, we explore the connection between the ..."
Abstract - Cited by 70 (11 self) - Add to MetaCart
and analyzed. These include models that allow a limited degree of nonindependence between sites (e.g., pairwise interactions in stem regions; Schöniger and von Haeseler 1994) and models that work with nonaligned sequences and explicitly model the insertion-deletion process as well as the site substitution

Finite element methods in probabilistic structural analysis: A selected review”.

by H Benaroya , M Rehak - Appl. Mech. Rew. , 1988
"... This review examines the field of structural analysis where finite element methods (FEMs) are used in a probabilistic setting. The finite element method is widely used, and its application in the field of structural analysis is universally accepted as an efficient numerical solution method. The ana ..."
Abstract - Cited by 30 (0 self) - Add to MetaCart
, discussion will be limited to a few representative papers dealing explicitly with finite element methods for the analysis of deterministic structures subjected to random loads. The justification for presenting the simpler and well-studied problem of deterministic systems lies with the fact that some

22.10.2009 Implementation of a Peer-to-Peer Multiplayer Game with Realtime Requirements

by Gutachten Alej, Ro Buchmann
"... Massively multiplayer online games (MMOGs) have become increasingly popular in the recent years, particularly in the form of online role-playing games (MMORPGs). These games support up to several ten thousand players interacting in a virtual game world. The current commercially successful games are ..."
Abstract - Add to MetaCart
completely event-based mode, supporting the execution of the game in an discrete-event-based network simulator. Third, a simple artificial intelligence player is developed for workload generation in large (and possibly simulated) networks. Furthermore, the newly developed transport protocol CUSP is applied

and

by Beta Ziliani, Derek Dreyer, Neelakantan R. Krishnaswami, Aleksandar Nanevski , 2015
"... Effective support for custom proof automation is essential for large-scale interactive proof develop-ment. However, existing languages for automation via tactics either (a) provide no way to specify the behavior of tactics within the base logic of the accompanying theorem prover, or (b) rely on adva ..."
Abstract - Add to MetaCart
Effective support for custom proof automation is essential for large-scale interactive proof develop-ment. However, existing languages for automation via tactics either (a) provide no way to specify the behavior of tactics within the base logic of the accompanying theorem prover, or (b) rely

unknown title

by unknown authors
"... It is interesting to note that as practical limita-tions were removed, several fundamental or principal limitations were established. For instance, Carnot showed that there was a fun-damental limit to how much energy could be extracted from a heat engine. Later this result was generalized to the sec ..."
Abstract - Add to MetaCart
It is interesting to note that as practical limita-tions were removed, several fundamental or principal limitations were established. For instance, Carnot showed that there was a fun-damental limit to how much energy could be extracted from a heat engine. Later this result was generalized

U-INVARIANT SAMPLING 1 U-Invariant Sampling: Extrapolation and Causal Interpolation from Generalized Samples

by Tomer Michaeli, Volker Pohl Member, Yonina C. Eldar, Senior Member
"... Abstract—Causal processing of a signal’s samples is crucial in on-line applications such as audio rate conversion, compression, tracking and more. This paper addresses the problems of predict-ing future samples and causally interpolating deterministic sig-nals. We treat a rich variety of sampling me ..."
Abstract - Add to MetaCart
Abstract—Causal processing of a signal’s samples is crucial in on-line applications such as audio rate conversion, compression, tracking and more. This paper addresses the problems of predict-ing future samples and causally interpolating deterministic sig-nals. We treat a rich variety of sampling
Next 10 →
Results 1 - 10 of 60
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University