Sciweavers

94 search results - page 2 / 19
» Formal Representation of Mathematics in a Dependently Typed ...
Sort
View
ITP
2010
165views Mathematics» more  ITP 2010»
13 years 9 months ago
A Mechanized Translation from Higher-Order Logic to Set Theory
Abstract. In order to make existing formalizations available for settheoretic developments, we present an automated translation of theories from Isabelle/HOL to Isabelle/ZF. This c...
Alexander Krauss, Andreas Schropp
GECCO
2008
Springer
120views Optimization» more  GECCO 2008»
13 years 6 months ago
Genetic programming with polymorphic types and higher-order functions
This article introduces our new approach to program representation for genetic programming (GP). We replace the usual s-expression representation scheme by a strongly-typed ion-ba...
Franck Binard, Amy P. Felty
CSL
2004
Springer
13 years 11 months ago
A Dependent Type Theory with Names and Binding
We consider the problem of providing formal support for working tract syntax involving variable binders. Gabbay and Pitts have shown in their work on Fraenkel-Mostowski (FM) set th...
Ulrich Schöpp, Ian Stark
ENTCS
2008
137views more  ENTCS 2008»
13 years 5 months ago
Computerizing Mathematical Text with MathLang
Mathematical texts can be computerized in many ways that capture differing amounts of the mathematical meaning. At one end, there is document imaging, which captures the arrangeme...
Fairouz Kamareddine, J. B. Wells
ASIAN
2006
Springer
91views Algorithms» more  ASIAN 2006»
13 years 9 months ago
A Type-Theoretic Framework for Formal Reasoning with Different Logical Foundations
Abstract. A type-theoretic framework for formal reasoning with different logical foundations is introduced and studied. With logic-enriched type theories formulated in a logical fr...
Zhaohui Luo