Sciweavers

101 search results - page 9 / 21
» Quotient Types: A Modular Approach
Sort
View
LICS
2012
IEEE
11 years 10 months ago
Foundational, Compositional (Co)datatypes for Higher-Order Logic: Category Theory Applied to Theorem Proving
—Interactive theorem provers based on higher-order logic (HOL) traditionally follow the definitional approach, reducing high-level specifications to logical primitives. This al...
Dmitriy Traytel, Andrei Popescu, Jasmin Christian ...
EUROCAST
2001
Springer
118views Hardware» more  EUROCAST 2001»
14 years 11 days ago
A Language Prototyping Tool Based on Semantic Building Blocks
We present a Language Prototyping System that facilitates the modular development of interpreters from semantic specifications. The theoretical basis of our system is the integrat...
José Emilio Labra Gayo, Juan Manuel Cueva L...
CTCS
1989
Springer
13 years 12 months ago
A Category-theoretic Account of Program Modules
The type-theoretic explanation of modules proposed to date (for programming languages like ML) is unsatisfactory, because it does not capture that evaluation of type-expressions i...
Eugenio Moggi
IANDC
2010
102views more  IANDC 2010»
13 years 6 months ago
Presenting functors on many-sorted varieties and applications
This paper studies several applications of the notion of a presentation of a functor by operations and equations. We show that the technically straightforward generalisation of th...
Alexander Kurz, Daniela Petrisan
FROCOS
2011
Springer
12 years 7 months ago
Harnessing First Order Termination Provers Using Higher Order Dependency Pairs
Many functional programs and higher order term rewrite systems contain, besides higher order rules, also a significant first order part. We discuss how an automatic termination p...
Carsten Fuhs, Cynthia Kop