System Description: Delphin -- A Functional Programming Language for Deductive Systems

Authors:
Adam Poswolsky;Carsten Schürmann
Affiliations:
Yale University, New Haven, CT, USA;IT University of Copenhagen, Copenhagen, Denmark
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2009

Citing 4
Cited 12

A framework for defining logics

Journal of the ACM (JACM)
Static Name Control for FreshML

LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science
A type-theoretic foundation for programming with higher-order abstract syntax and first-class substitutions

Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Practical programming with higher-order encodings and dependent types

ESOP'08/ETAPS'08 Proceedings of the Theory and practice of software, 17th European conference on Programming languages and systems

A fresh look at programming with names and binders

Proceedings of the 15th ACM SIGPLAN international conference on Functional programming
Programming inductive proofs: a new approach based on contextual types

Verification, induction termination analysis
Programming inductive proofs: a new approach based on contextual types

Verification, induction termination analysis
Higher-order dynamic pattern unification for dependent types and records

TLCA'11 Proceedings of the 10th international conference on Typed lambda calculi and applications
How to make ad hoc proof automation less ad hoc

Proceedings of the 16th ACM SIGPLAN international conference on Functional programming
Binders unbound

Proceedings of the 16th ACM SIGPLAN international conference on Functional programming
Programming with binders and indexed data-types

POPL '12 Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Beluga: a framework for programming and reasoning with deductive systems (system description)

IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning
LFP: a logical framework with external predicates

Proceedings of the seventh international workshop on Logical frameworks and meta-languages, theory and practice
Compiling contextual objects: bringing higher-order abstract syntax to programmers

PLPV '13 Proceedings of the 7th workshop on Programming languages meets program verification
Mtac: a monad for typed tactic programming in Coq

Proceedings of the 18th ACM SIGPLAN international conference on Functional programming
Combinators for impure yet hygienic code generation

Proceedings of the ACM SIGPLAN 2014 Workshop on Partial Evaluation and Program Manipulation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Delphin is a functional programming language [Adam Poswolsky and Carsten Schurmann. Practical programming with higher-order encodings and dependent types. In European Symposium on Programming (ESOP), 2008] utilizing dependent higher-order datatypes. Delphin's two-level type-system cleanly separates data from computation, allowing for decidable type checking. The data level is LF [Robert Harper, Furio Honsell, and Gordon Plotkin. A framework for defining logics. Journal of the Association for Computing Machinery, 40(1):143-184, January 1993], which allows for the specification of deductive systems following the judgments-as-types methodology. The computation level facilitates the manipulation of such encodings by providing facilities for pattern matching, recursion, and the dynamic creation of new parameters (which can be thought of as scoped constants). Delphin's documentation and examples are available online at http://delphin.logosphere.org.