Sciweavers

3481 search results - page 441 / 697
» Higher-Order Logic Programming as Constraint Logic Programmi...
Sort
View
FOSSACS
2009
Springer
15 years 11 months ago
Beyond Shapes: Lists with Ordered Data
Standard analysis on recursive data structures restrict their attention to shape properties (for instance, a program that manipulates a list returns a list), excluding properties t...
Kshitij Bansal, Rémi Brochenin, Étie...
PADL
2004
Springer
15 years 10 months ago
Implementing Cut Elimination: A Case Study of Simulating Dependent Types in Haskell
Gentzen’s Hauptsatz – cut elimination theorem – in sequent calculi reveals a fundamental property on logic connectives in various logics such as classical logic and intuition...
Chiyan Chen, Dengping Zhu, Hongwei Xi
PPDP
1999
Springer
15 years 8 months ago
A Calculus for Interaction Nets
hemical abstract machine Shinya Sato Himeji Dokkyo University, Faculty of Econoinformatics, 7-2-1 Kamiohno, Himeji-shi, Hyogo 670-8524, Japan Ian Mackie LIX, CNRS UMR 7161, ´Ecole...
Maribel Fernández, Ian Mackie
EUSAI
2007
Springer
15 years 6 months ago
A Compiler for the Smart Space
Developing applications for smart spaces is a challenging task. Most programming systems narrowly focus on the embedded computer infrastructure and neglect the spatial aspect of th...
Urs Bischoff, Gerd Kortuem
146
Voted
CORR
2010
Springer
151views Education» more  CORR 2010»
15 years 4 months ago
Redundancies in Dependently Typed Lambda Calculi and Their Relevance to Proof Search
Dependently typed -calculi such as the Logical Framework (LF) are capable of representing relationships between terms through types. By exploiting the "formulas-as-types"...
Zachary Snow, David Baelde, Gopalan Nadathur