SCOPUS 정보 검색 플랫폼

Electronic Notes in Theoretical Computer Science

Volumn 228, Issue C, 2009, Pages 113-120

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

(2) Poswolsky, Adam a Schürmann, Carsten b

a YALE UNIVERSITY (United States)

b IT UNIVERSITY OF COPENHAGEN (Denmark)

Author keywords

Delphin; dependent types; higher order abstract syntax; HOAS; LF; Twelf

Indexed keywords

ABSTRACTING; C (PROGRAMMING LANGUAGE); COMPUTER PROGRAMMING; COMPUTER SOFTWARE; COMPUTERS; ENCODING (SYMBOLS); FUNCTIONAL PROGRAMMING; LINGUISTICS; MACHINERY; PATTERN MATCHING; SYNTACTICS; TELECOMMUNICATION NETWORKS;

DELPHIN; DEPENDENT TYPES; HIGHER-ORDER ABSTRACT SYNTAX; HOAS; LF; TWELF;

COMPUTER PROGRAMMING LANGUAGES;

EID: 58149379684 PISSN: 15710661 EISSN: None Source Type: Journal
DOI: 10.1016/j.entcs.2008.12.120 Document Type: Article

Times cited : (39)

References (9)

1
- 23944501086
- A new approach to abstract syntax with variable binding
- Gabbay M., and Pitts A.M. A new approach to abstract syntax with variable binding. Formal Aspects Computing 13 3-5 (2002) 341-363
- (2002) Formal Aspects Computing , vol.13 , Issue.3-5 , pp. 341-363
- Gabbay, M.¹ Pitts, A.M.²

2
- 0027353175
- A framework for defining logics
- Harper R., Honsell F., and Plotkin G. A framework for defining logics. Journal of the Association for Computing Machinery 40 1 (January 1993) 143-184
- (1993) Journal of the Association for Computing Machinery , vol.40 , Issue.1 , pp. 143-184
- Harper, R.¹ Honsell, F.² Plotkin, G.³

3
- 58149385129
- Brigitte Pientka. A type-theoretic foundation for programming with higher-order abstract syntax and first-class substitutions. In Principles of Programming Languages, POPL, 2008
- Brigitte Pientka. A type-theoretic foundation for programming with higher-order abstract syntax and first-class substitutions. In Principles of Programming Languages, POPL, 2008

4
- 82755188155
- François Pottier. Static name control for FreshML. In Twenty-Second Annual IEEE Symposium on Logic In Computer Science (LICS'07), Wroclaw, Poland, July 2007
- François Pottier. Static name control for FreshML. In Twenty-Second Annual IEEE Symposium on Logic In Computer Science (LICS'07), Wroclaw, Poland, July 2007

5
- 58149379079
- Frank Pfenning and Carsten Schürmann. Twelf User's Guide, 1.2 edition, September 1998. Available as Technical Report CMU-CS-98-173, Carnegie Mellon University
- Frank Pfenning and Carsten Schürmann. Twelf User's Guide, 1.2 edition, September 1998. Available as Technical Report CMU-CS-98-173, Carnegie Mellon University

6
- 58149393902
- Adam Poswolsky and Carsten Schürmann. Practical programming with higher-order encodings and dependent types. In European Symposium on Programming (ESOP), 2008
- Adam Poswolsky and Carsten Schürmann. Practical programming with higher-order encodings and dependent types. In European Symposium on Programming (ESOP), 2008

7
- 58149373473
- Carsten Schürmann. Automating the Meta-Theory of Deductive Systems. PhD thesis, Carnegie Mellon University, 2000. CMU-CS-00-146
- Carsten Schürmann. Automating the Meta-Theory of Deductive Systems. PhD thesis, Carnegie Mellon University, 2000. CMU-CS-00-146

8
- 35248819262
- A coverage checking algorithm for LF
- Proccedings of Theorem Proving in Higher Order Logics. Basin D., and Wolff B. (Eds). (TPHOLs'03), Rome, Italy, Springer Verlag
- Schürmann C., and Pfenning F. A coverage checking algorithm for LF. In: Basin D., and Wolff B. (Eds). Proccedings of Theorem Proving in Higher Order Logics. (TPHOLs'03), Rome, Italy. LNCS volume 2758 (2003), Springer Verlag
- (2003) LNCS , vol.2758
- Schürmann, C.¹ Pfenning, F.²

9
- 33645265227
- Logosphere homepage:
- Schürmann C., Pfenning F., and Shankar N. Logosphere. A Formal Digital Library. Logosphere homepage:. http://www.logosphere.org
- Logosphere. A Formal Digital Library
- Schürmann, C.¹ Pfenning, F.² Shankar, N.³

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