Dependently Typed Pattern Matching

The mechanism for declaring datatypes to model data structures in functional programming languages such as Standard ML and Haskell can offer both convenience in programming and clarity in code. With the introduction of dependent datatypes in DML, the programmer can model data structures with more ac...

Full description

Bibliographic Details
Main Author: Hongwei Xi
Other Authors: The Pennsylvania State University CiteSeerX Archives
Format: Text
Language:English
Published: 2003
Subjects:
Haskell
DML
Online Access:http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.4.1762
http://www.cs.bu.edu/~hwxi/academic/papers/sblp03.ps
id ftciteseerx:oai:CiteSeerX.psu:10.1.1.4.1762
record_format openpolar
spelling ftciteseerx:oai:CiteSeerX.psu:10.1.1.4.1762 2023-05-15T16:01:43+02:00 Dependently Typed Pattern Matching Hongwei Xi The Pennsylvania State University CiteSeerX Archives 2003 application/postscript http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.4.1762 http://www.cs.bu.edu/~hwxi/academic/papers/sblp03.ps en eng http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.4.1762 http://www.cs.bu.edu/~hwxi/academic/papers/sblp03.ps Metadata may be used without restrictions as long as the oai identifier remains attached to it. http://www.cs.bu.edu/~hwxi/academic/papers/sblp03.ps text 2003 ftciteseerx 2016-09-25T00:14:22Z The mechanism for declaring datatypes to model data structures in functional programming languages such as Standard ML and Haskell can offer both convenience in programming and clarity in code. With the introduction of dependent datatypes in DML, the programmer can model data structures with more accuracy, thus capturing more program invariants. In this paper, we study some practical aspects of dependent datatypes that affect both type-checking and compiling pattern matching. The results, which have already been tested, demonstrate that dependent datatype can not only offer various programming benefits but also lead to performance gains, yielding a concrete case where safer programs run faster. Text DML Unknown Haskell ENVELOPE(-64.279,-64.279,-66.749,-66.749)
institution Open Polar
collection Unknown
op_collection_id ftciteseerx
language English
description The mechanism for declaring datatypes to model data structures in functional programming languages such as Standard ML and Haskell can offer both convenience in programming and clarity in code. With the introduction of dependent datatypes in DML, the programmer can model data structures with more accuracy, thus capturing more program invariants. In this paper, we study some practical aspects of dependent datatypes that affect both type-checking and compiling pattern matching. The results, which have already been tested, demonstrate that dependent datatype can not only offer various programming benefits but also lead to performance gains, yielding a concrete case where safer programs run faster.
author2 The Pennsylvania State University CiteSeerX Archives
format Text
author Hongwei Xi
spellingShingle Hongwei Xi
Dependently Typed Pattern Matching
author_facet Hongwei Xi
author_sort Hongwei Xi
title Dependently Typed Pattern Matching
title_short Dependently Typed Pattern Matching
title_full Dependently Typed Pattern Matching
title_fullStr Dependently Typed Pattern Matching
title_full_unstemmed Dependently Typed Pattern Matching
title_sort dependently typed pattern matching
publishDate 2003
url http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.4.1762
http://www.cs.bu.edu/~hwxi/academic/papers/sblp03.ps
long_lat ENVELOPE(-64.279,-64.279,-66.749,-66.749)
geographic Haskell
geographic_facet Haskell
genre DML
genre_facet DML
op_source http://www.cs.bu.edu/~hwxi/academic/papers/sblp03.ps
op_relation http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.4.1762
http://www.cs.bu.edu/~hwxi/academic/papers/sblp03.ps
op_rights Metadata may be used without restrictions as long as the oai identifier remains attached to it.
_version_ 1766397471328567296

Similar Items