Sciweavers

2076 search results - page 193 / 416
» Functional logic overloading
Sort
View
142
Voted
FLOPS
2010
Springer
15 years 10 months ago
Beluga: Programming with Dependent Types, Contextual Data, and Contexts
The logical framework LF provides an elegant foundation for specifying formal systems and proofs and it is used successfully in a wide range of applications such as certifying code...
Brigitte Pientka
115
Voted
TPHOL
2005
IEEE
15 years 9 months ago
A Design Structure for Higher Order Quotients
The quotient operation is a standard feature of set theory, where a set is partitioned into subsets by an equivalence relation. We reinterpret this idea for higher order logic, whe...
Peter V. Homeier
129
Voted
DIAGRAMS
2004
Springer
15 years 9 months ago
Generating Readable Proofs: A Heuristic Approach to Theorem Proving With Spider Diagrams
An important aim of diagrammatic reasoning is to make it easier for people to create and understand logical arguments. We have worked on spider diagrams, which visually express log...
Jean Flower, Judith Masthoff, Gem Stapleton
118
Voted
TPHOL
2003
IEEE
15 years 8 months ago
Inductive Invariants for Nested Recursion
Abstract. We show that certain input-output relations, termed inductive invariants are of central importance for termination proofs of algorithms defined by nested recursion. Indu...
Sava Krstic, John Matthews
125
Voted
ISMVL
2010
IEEE
191views Hardware» more  ISMVL 2010»
15 years 8 months ago
Toffoli Gate Implementation Using the Billiard Ball Model
— In this paper we review the Billiard Ball Model (BBM) introduced by Toffoli and Fredkin. The analysis of a previous approach to design reversible networks based on BBM it shown...
Hadi Hosseini, Gerhard W. Dueck