메뉴 건너뛰기




Volumn , Issue , 2009, Pages 61-72

Type-safe diff for families of datatypes

Author keywords

Datatype generic programming; Dependent types; Edit distance

Indexed keywords

ABSTRACT SYNTAX TREES; CLASSIC ALGORITHM; DATA TYPE; DATATYPES; DEPENDENT TYPES; EDIT DISTANCE; FUNCTIONAL PROGRAMMING LANGUAGES; GENERIC IMPLEMENTATION; GENERIC PROGRAMMING; HASKELL; LONGEST COMMON SUBSEQUENCES; MEMOIZATION; PROGRAM CODE; TEXT FILE; TYPE SAFETY; TYPE SYSTEMS;

EID: 70450198436     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1596614.1596624     Document Type: Conference Paper
Times cited : (12)

References (28)
  • 1
    • 0842266468 scopus 로고    scopus 로고
    • Universes for generic programs and proofs in dependent type theory
    • Marcin Benke, Peter Dybjer, and Patrik Jansson. Universes for Generic Programs and Proofs in Dependent Type Theory. Nordic Journal of Computing, 10(4):265-289, 2003.
    • (2003) Nordic Journal of Computing , vol.10 , Issue.4 , pp. 265-289
    • Benke, M.1    Dybjer, P.2    Jansson, P.3
  • 3
    • 18444373554 scopus 로고    scopus 로고
    • A survey on tree edit distance and related problems
    • Philip Bille. A survey on tree edit distance and related problems. Theor. Comput. Sci., 337(1-3):217-239, 2005.
    • (2005) Theor. Comput. Sci. , vol.337 , Issue.1-3 , pp. 217-239
    • Bille, P.1
  • 6
    • 70450170255 scopus 로고    scopus 로고
    • The application/json media type for javascript object notation (JSON)
    • July
    • Douglas Crockford. The application/json Media Type for JavaScript Object Notation (JSON). RFC 4627, July 2006.
    • (2006) RFC 4627
    • Crockford, D.1
  • 7
    • 38149027040 scopus 로고    scopus 로고
    • Datatype-generic programming
    • In Roland Backhouse, Jeremy Gibbons, Ralf Hinze, and Johan Jeuring, editors, Springer Berlin/Heidelberg
    • Jeremy Gibbons. Datatype-Generic Programming. In Roland Backhouse, Jeremy Gibbons, Ralf Hinze, and Johan Jeuring, editors, Datatype- Generic Programming, pages 1-71. Springer Berlin/Heidelberg, 2007.
    • (2007) Datatype- Generic Programming , pp. 1-71
    • Gibbons, J.1
  • 14
    • 33746103228 scopus 로고    scopus 로고
    • On the maximum common embedded subtree problem for ordered trees
    • C. Iliopoulos and T Lecroq, editors, chapter 7. King's College London Publications
    • Antoni Lozano and Gabriel Valiente. On the Maximum Common Embedded Subtree Problem for Ordered Trees. In In C. Iliopoulos and T Lecroq, editors, String Algorithmics, chapter 7. King's College London Publications, 2004.
    • (2004) String Algorithmics
    • Lozano, A.1    Valiente, G.2
  • 16
    • 70149084051 scopus 로고    scopus 로고
    • PhD thesis, Department of Computer Science and Engineering, Chalmers University of Technology and Göteborg University, Göteborg, Sweden
    • Ulf Norell. Towards a practical programming language based on dependent type theory. PhD thesis, Department of Computer Science and Engineering, Chalmers University of Technology and Göteborg University, Göteborg, Sweden, 2007.
    • (2007) Towards A Practical Programming Language Based on Dependent Type Theory
    • Norell, U.1
  • 18
    • 63149199548 scopus 로고    scopus 로고
    • Extensible and modular generics for the masses
    • Henrik Nilsson, editor, Intellect, Volume 7 of Trends in Functional Programming
    • Bruno C. D. S. Oliveira, Ralf Hinze, and Andres Löh. Extensible and Modular Generics for the Masses. In Henrik Nilsson, editor, Trends in Functional Programming, volume 7 of Trends in Functional Programming, pages 199-216. Intellect, 2006.
    • (2006) Trends in Functional Programming , pp. 199-216
    • Oliveira, B.C.D.S.1    Hinze, R.2    Löh, A.3
  • 20
    • 33751357071 scopus 로고    scopus 로고
    • Change detection in XML trees: A survey
    • Faculty of Electrical Engineering, Mathematics, and Computer Science, University of Twente, June
    • rd Twente Student Conference on IT. Faculty of Electrical Engineering, Mathematics, and Computer Science, University of Twente, June 2005.
    • (2005) rd Twente Student Conference on IT
    • Peters, L.1
  • 21
    • 70450195906 scopus 로고    scopus 로고
    • September
    • Dan Piponi. The Antidiagonal. http://blog.sigfpe.com/2007/09/type- ofdistinct-pairs.html, September 2007a.
    • (2007) The Antidiagonal
    • Piponi., D.1
  • 22
    • 70450195907 scopus 로고    scopus 로고
    • September
    • Dan Piponi. Tries and their Derivatives. http://blog.sigfpe.com/2007/09/ tries-and-their-derivatives-08.html, September 2007b.
    • (2007) Tries and Their Derivatives
    • Piponi, D.1
  • 24
    • 0001122858 scopus 로고
    • The tree-to-tree editing problem
    • December
    • S. Selkow. The tree-to-tree editing problem. Information Processing Letters, 6(6):184-186, December 1977.
    • (1977) Information Processing Letters , vol.6 , Issue.6 , pp. 184-186
    • Selkow, S.1
  • 25
    • 0036983358 scopus 로고    scopus 로고
    • Template meta-programming for Haskell
    • December
    • Tim Sheard and Simon P. Jones. Template Meta-programming for Haskell. SIGPLAN Not., 37(12):60-75, December 2002.
    • (2002) SIGPLAN Not. , vol.37 , Issue.12 , pp. 60-75
    • Sheard, T.1    Jones, S.P.2
  • 27
    • 0026185673 scopus 로고
    • Identifying syntactic differences between two programs
    • Wuu Yang. Identifying Syntactic Differences Between Two Programs. Software: Practice and Experience, 21(7):739-755, 1991.
    • (1991) Software: Practice and Experience , vol.21 , Issue.7 , pp. 739-755
    • Yang, W.1
  • 28
    • 0024889169 scopus 로고
    • Simple fast algorithms for the editing distance between trees and related problems
    • Kaizhong Zhang and Dennis Shasha. Simple Fast Algorithms for the Editing Distance between Trees and Related Problems. SIAM Journal on Computing, 18(6):1245-1262, 1989.
    • (1989) SIAM Journal on Computing , vol.18 , Issue.6 , pp. 1245-1262
    • Zhang, K.1    Shasha, D.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.