메뉴 건너뛰기




Volumn 2006, Issue , 2006, Pages 72-83

Strongly typed memory areas: Programming systems-level data structures in a functional language

Author keywords

Data representation; Improvement; Memory areas; Memory manipulation; Qualified types; Systems programming

Indexed keywords

COMPUTER HARDWARE; COMPUTER PROGRAMMING LANGUAGES; COMPUTER SOFTWARE; COMPUTER SYSTEMS PROGRAMMING; DATA STRUCTURES; PROGRAM ASSEMBLERS; SYNTACTICS;

EID: 33751010773     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1159842.1159851     Document Type: Conference Paper
Times cited : (15)

References (26)
  • 13
    • 1542487235 scopus 로고
    • Technical Report YALEU/DCS/RR-1040, Yale University, New Haven, Connecticut, USA, June
    • Mark P. Jones. Simplifying and improving qualified types. Technical Report YALEU/DCS/RR-1040, Yale University, New Haven, Connecticut, USA, June 1994.
    • (1994) Simplifying and Improving Qualified Types
    • Jones, M.P.1
  • 26
    • 0032281046 scopus 로고    scopus 로고
    • From ML to Ada: Strongly-typed language interoperability via source translation
    • July
    • Andrew Tolmach and Dino P. Oliva. From ML to Ada: Strongly-typed language interoperability via source translation. Journal of Functional Programming, 8(4):367-412, July 1998.
    • (1998) Journal of Functional Programming , vol.8 , Issue.4 , pp. 367-412
    • Tolmach, A.1    Oliva, D.P.2


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