Full abstraction and universality via realisability

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 1999, Pages 174-182

  Marz, Michael ^a   Rohr, Alexander ^a   Streicher, Thomas ^a  

^a DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

LONGLEY-PHOA CONJECTURE; REALISIBILITY; SEQUENTIAL FUNCTIONAL PROGRAMMING LANGUAGE; UNIVERSALITY;

ALGEBRA; COMPUTATION THEORY; DIGITAL ARITHMETIC; MATHEMATICAL PROGRAMMING; RECURSIVE FUNCTIONS; THEOREM PROVING;

COMPUTATIONAL LINGUISTICS;

EID: 0032597540     PISSN: None     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (18)